435. 無(wú)重疊區(qū)間

class Solution {
public:
static bool cmp(vector<int>&a,vector<int>&b)
    {
        if(a[0]==b[0]) return a[1]<b[1];
        return a[0]<b[0];
    }
    int eraseOverlapIntervals(vector<vector<int>>& intervals) {
        sort(intervals.begin(),intervals.end(),cmp);
        int left=intervals[0][0];
        int right=intervals[0][1];
        int count=0;
        for(int i=1;i<intervals.size();i++)
        {
            if(intervals[i][0]<right)
            {
                count++;
                left=min(left,intervals[i][0]);
                right=min(right,intervals[i][1]);
            }
            else 
            {
                left=min(left,intervals[i][0]);
                right=max(right,intervals[i][1]);
            }
        }
        return count;

    }
};

763. 劃分字母區(qū)間

class Solution {
public:
    vector<int> partitionLabels(string s) {
        unordered_map<char,int> umap;
        for(int i=0;i<s.size();i++)
        {
            umap[s[i]]++;
        }
        unordered_set<char> uset;
        vector<int> res;
        int count=0;
        int pre=0;
        for(int i=0;i<s.size();i++)
        {
            uset.insert(s[i]);
            cout<<uset.size()<<endl;
            umap[s[i]]--;
            if(umap[s[i]]==0)
            {
                count++;
                cout<<"count"<<count<<endl;
                if(count==uset.size())
                {
                    res.push_back(i+1-pre);
                    pre+=i+1-pre;
                    count=0;
                    uset.clear();
                }
            }
        }
        return res;

    }
};

56. 合并區(qū)間

class Solution {
public:
    static bool cmp(vector<int>&a,vector<int>&b)
    {
        if(a[0]==b[0]) return a[1]<b[1];
        return a[0]<b[0];
    }
    vector<vector<int>> merge(vector<vector<int>>& intervals) {
        sort(intervals.begin(),intervals.end(),cmp);
        vector<vector<int>> res;
        int left=intervals[0][0];
        int right=intervals[0][1];
        if(intervals.size()==1) return intervals;
        for(int i=1;i<intervals.size();i++)
        {
            if(intervals[i][0]<=right)
            {
                left=min(left,intervals[i][0]);
                right=max(right,intervals[i][1]);
            }
            else
            {
                res.push_back(vector<int> {left,right});
                left=intervals[i][0];
                right=intervals[i][1];
                
            }
            if(i==intervals.size()-1)
                res.push_back(vector<int> {left,right});
        }
        return res;

    }
};

文章來(lái)源地址http://www.zghlxwxcb.cn/news/detail-658125.html

到了這里，關(guān)于代碼隨想錄打卡第35天的文章就介紹完了。如果您還想了解更多內(nèi)容，請(qǐng)?jiān)谟疑辖撬阉鱐OY模板網(wǎng)以前的文章或繼續(xù)瀏覽下面的相關(guān)文章，希望大家以后多多支持TOY模板網(wǎng)！