题解 | #合并区间#

//先排序
//其次放入[0]
//接着遍历数组，对比res.back().end与[i]的start
//重叠则合并，否则就加入res
/**
 * Definition for an interval.
 * struct Interval {
 *     int start;
 *     int end;
 *     Interval() : start(0), end(0) {}
 *     Interval(int s, int e) : start(s), end(e) {}
 * };
 */
#include <algorithm>
#include <vector>
class Solution {
public:
    static bool cmp(Interval &a,Interval &b){
        return a.start<b.start;
    }

    vector<Interval> merge(vector<Interval> &intervals) {
        vector<Interval> res;
        if (intervals.size()==0)
            return res;
        //排序
        sort(intervals.begin(), intervals.end(),cmp);
        res.push_back(intervals[0]);
        for (int i=0;i<intervals.size();i++){
            if (res.back().end>=intervals[i].start) {
                res.back().end=max(res.back().end,intervals[i].end);
            }
            else {
                res.push_back(intervals[i]);
            }

        }
        return res;
        
    }
};