leetcode56 区间合并

class Solution {
public:
    vector<Interval> merge(vector<Interval>& intervals) {
        vector<Interval> res;
        if(intervals.empty()) return res;
        sort(intervals.begin(),intervals.end(),[](Interval a,Interval b){return a.start<b.start;});  //按照开头位置排序
        res.push_back(intervals[0]);
        for(int i=0;i<intervals.size();++i)
        {
            if(res.back().end<intervals[i].start) 
                res.push_back(intervals[i]);  //下一个区间与当前最后一个区间无交集
            else 
                res.back().end=max(intervals[i].end,res.back().end); //有交集
        }
        return res;
        
    }
};

参考
https://leetcode.com/problems/merge-intervals/discuss/21242/C%2B%2B-10-line-solution.-easing-understanding