[leetcode]56. Merge Intervals

题目链接：https://leetcode.com/problems/merge-intervals/#/description

Given a collection of intervals, merge all overlapping intervals.

For example,
Given [1,3],[2,6],[8,10],[15,18],
return [1,6],[8,10],[15,18].

class Solution{
public:
    vector<Interval> merge(vector<Interval>& intervals)
    {
        vector<Interval> res;
        if(intervals.empty())
            return res;
        auto cmp=[](Interval a,Interval b){
            if (a.start==b.start)
                return a.end<b.end;
            return a.start<b.start;
        };
        sort(intervals.begin(),intervals.end(),cmp);
        res.push_back(intervals[0]);
        for(int i=1;i<intervals.size();i++)
        {
            if(res.back().end<intervals[i].start)
                res.push_back(intervals[i]);
            else
                res.back().end=max(res.back().end,intervals[i].end);
        }
        return res;
    }
};