题解 | #合并区间#

/**
 * Definition for an interval.
 * struct Interval {
 *     int start;
 *     int end;
 *     Interval() : start(0), end(0) {}
 *     Interval(int s, int e) : start(s), end(e) {}
 * };
 */
class Solution {
public:
    static bool cmp(const Interval& a, const Interval& b){
        return a.start < b.start;
    }
    
    vector<Interval> merge(vector<Interval> &intervals) {
        sort(intervals.begin(), intervals.end(), cmp);
        
        vector<Interval> res;
        int l = 0, r = 0;
        int i = 0, n = intervals.size();
        while(i < n){
            l = intervals[i].start;
            r = intervals[i].end;

            while(i + 1 < n && r >= intervals[i + 1].start){
                i++; //
                r = max(r, intervals[i].end); //因为i先加1了
            }
            
            res.push_back({l, r});
            i++;
        }
        
        return res;
    }
};