Leetcode 第 293 场周赛

class Solution {
public:
    vector removeAnagrams(vector& s) {
        vectorres;
        res.push_back(s[0]);
        for(int i=1;i
            string a=s[i-1],b=s[i];
            sort(a.begin(),a.end());
            sort(b.begin(),b.end());
            if(a==b)continue;
            res.push_back(s[i]);
        }
        return res;
    }
};

class Solution {
public:
    int maxConsecutive(int l, int r, vector& a) {
        sort(a.begin(),a.end());
        int res=0;
        res=max(a[0]-l,r-a.back());
        for(int i=1;i 
6065. 按位与结果大于零的最长组合 
class Solution {
public:
    int largestCombination(vector& a) {
        int res=0;
        for(int i=0;i<24;i++)
        {
            int cnt=0;
            for(auto x : a)
            {
                if(x>>i&1)
                    cnt++;
            }
            res=max(res,cnt);
        }
        return res;
    }
};
 
6066. 统计区间中的整数数目 
class CountIntervals {
public:
    int cnt;
    set>s;
    CountIntervals() {
        cnt=0;
    }
    
    void add(int left, int right) {
        auto it=s.lower_bound({left,left});
        if(it!=s.begin())it--;
        int l=left,r=right;
        while(it!=s.end()&&it->first<=right)
        {
            if(it->second
                it++;
                continue;
            }
            l=min(l,it->first);
            r=max(r,it->second);
            cnt-=it->second-it->first+1;
            s.erase(*it);
            it++;
        }
        s.insert({l,r});
        cnt+=r-l+1;
    }
    
    int count() {
        return cnt;
    }
};