LeetCode - 56.合并区间

class Solution {
public:
    vector> merge(vector>& intervals) {
        if(intervals.size()==0){
            return intervals;
        }
        sort(intervals.begin(),intervals.end());
        for(int i=0;i= intervals[i+1][0] && intervals[i][1] < intervals[i+1][1]){
                intervals[i+1][0] = intervals[i][0];
                intervals.erase(intervals.begin()+i);
                check = 1;
            }
            while(i= intervals[i+1][0] && intervals[i][1] >= intervals[i+1][1]){
                intervals[i+1][1] = intervals[i][1];
                intervals[i+1][0] = intervals[i][0];
                intervals.erase(intervals.begin()+i);
                check = 1;
            }
            if(!check){
                i++;
            }
        }
        return intervals;
    }
};

https://leetcode-cn.com/problems/merge-intervals/submissions/