LeetCode 56 - Merge Intervals

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]

.

My Code

/**
* 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:
bool static comp(const Interval& a, const Interval& b)
{
return a.start < b.start;
}

vector<Interval> merge(vector<Interval>& intervals) {
int n = intervals.size();
if (n <= 1)
return intervals;

sort(intervals.begin(), intervals.end(), comp);
vector<Interval> merged;
Interval cur = intervals[0];
for (int i = 1; i < intervals.size(); i++)
if (intervals[i].start >= cur.start && intervals[i].start <= cur.end)
cur.end = max(cur.end, intervals[i].end);
else
{
merged.push_back(cur);
cur = intervals[i];
}
merged.push_back(cur);

return merged;
}
};Runtime: 600 ms