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

Solution:

/**
 * 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 comp(Interval a, Interval b)
    {
        return a.start < b.start;
    }
    vector<Interval> merge(vector<Interval> &intervals) {
        vector<Interval> res;
        sort(intervals.begin(), intervals.end(), comp);
        vector<Interval>::iterator iter = intervals.begin();
        for(; iter != intervals.end(); ++iter)
        {
            vector<Interval>::iterator next = iter+1;
            if(next == intervals.end() || (*next).start > (*iter).end)
            {
                res.push_back(*iter);
                continue;
            }
            else
            {
                (*next).start = (*iter).start;
                if((*next).end < (*iter).end) (*next).end = (*iter).end;
            }
        }

        return res;
    }
};