leetcode 56: Merge Intervals

/**
 * 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(Interval& a,Interval& b)
    {
        return a.start<b.start||a.start==b.start&&a.end<b.end;
    }
    vector<Interval> merge(vector<Interval>& intervals) {
        if(intervals.size()==0||intervals.size()==1)
            return intervals;
        vector<Interval> res;
        sort(intervals.begin(),intervals.end(),cmp);
        Interval curr=intervals[0];
        for(int i=1;i<intervals.size();i++)
        {
            if(intervals[i].start>curr.end)
            {
                res.push_back(curr);
                curr=intervals[i];
            }
            else
            {
                curr.start=min(curr.start,intervals[i].start);
                curr.end=max(curr.end,intervals[i].end);
            }
        }
        res.push_back(curr);
        return res;
    }
};