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].
1:采用sort进行排序(return a.start < b.start)
vector<Interval> merge(vector<Interval> &intervals) {
if(intervals.size() <= 1)
{
return intervals;
}
sort(intervals.begin(), intervals.end(), comp1);
vector<Interval> result;
Interval temp(intervals[0].start, intervals[0].end);
for(int i = 1; i < (int)intervals.size(); i++)
{
if(temp.end < intervals[i].start)
{
result.push_back(temp);
temp.start = intervals[i].start;
temp.end = intervals[i].end;
}
else if(temp.end >= intervals[i].start && temp.end <= intervals[i].end)
{
temp.end = intervals[i].end;
}
else
{
continue;
}
}
result.push_back(temp);
return result;
}