[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) {}
 * };
 */
bool cmp(const Interval &a, const Interval &b)
{
    return a.start < b.start;
}
class Solution {
public:
    vector<Interval> merge(vector<Interval> &intervals) {
        sort(intervals.begin(), intervals.end(), cmp);
        vector<Interval> res;
        if(intervals.empty())     return res;
        vector<Interval>::iterator it = intervals.begin();
        Interval temp = *it++;
        if(it == intervals.end())
            res.push_back(temp);
        else
        {
            while(it != intervals.end())
            {
                while((*it).start <= temp.end && it != intervals.end())
                {
                    temp.end = max(temp.end, (*it).end);
                    ++it;
                }
                res.push_back(temp);
                temp = *it;
            }
        }
        return res;
    }
};