leetcode（力扣）435. 无重叠区间||763. 划分字母区间||56. 合并区间

435. 无重叠区间

class Solution {
private:
      static bool cmp(vector& a,vector& b){
          return a[1]>& intervals) {
        if(intervals.size()==0) return 0;
        sort(intervals.begin(),intervals.end(),cmp);

        int count=1;
        int end=intervals[0][1];
        for(int i=1;i

763. 划分字母区间

class Solution {
public:
    vector partitionLabels(string s) {
        vector result;
        int ch[27]={0};
        int right=0;
        int left=0;

        if(s.size()==0) return result;

        for(int i=0;i

56. 合并区间

class Solution {
private:
     static bool cmp(vector& a,vector& b){
         return a[0]> merge(vector>& intervals) {
         vector> result;
         int flag=false;
         if(intervals.size()==0) return result;
         sort(intervals.begin(),intervals.end(),cmp);

         for(int i=1;i=intervals[i][0]){
                 end=max(end,intervals[i][1]);
                 
                 if(i==intervals.size()-1) flag=true;
                 i++;
             }
             result.push_back({start,end});
         }

         if(flag==false){
             result.push_back({intervals[intervals.size()-1][0],intervals[intervals.size()-1][1]});
         }
         return result;
    }
};