Leetcode|Merge Intervals

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].

没说排好序的，那么先排序。然后就简单了。

代码如下：

/**
 * 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:
    vector<Interval> merge(vector<Interval>& intervals) {
        vector<Interval> res;
        if(intervals.size()==0)
        {
            return res;
        }
        sort(intervals.begin(),intervals.end(),cmp);
        Interval tmp=intervals[0];
        for(int i=1;i<intervals.size();i++)
        {
           if(tmp.end<intervals[i].start)
           {
               res.push_back(tmp);
               tmp=intervals[i];
           }else
           {
               tmp.end=tmp.end<intervals[i].end?intervals[i].end:tmp.end;
           }
               
        }
        res.push_back(tmp);
        return res;
    }
private:
    static bool cmp(Interval& l1,Interval& l2)
    {
        return l1.start!=l2.start?l1.start<l2.start:l1.end<l2.end;
    }
};