题目:
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) {}
* };
*/
class Solution {
public:
static bool compareInterval(Interval& a, Interval& b)
{
return a.start < b.start;
}
vector<Interval> merge(vector<Interval>& intervals) {
vector<Interval> res;
if (intervals.empty())
{
return res;
}
//按照区间的start进行排序
std::sort(intervals.begin(), intervals.end(), compareInterval);
res.push_back(intervals[0]);
//测试intervals中的每个元素,如果可以与res的最后一个元素合并,那么就合并;不能合并就压入到res的最后
for (int i = 1; i < intervals.size(); ++i)
{
if (intervals[i].start <= res[res.size() - 1].end)
{
if (res[res.size() - 1].end < intervals[i].end)
{
res[res.size() - 1].end = intervals[i].end;
}
}
else
{
res.push_back(intervals[i]);
}
}
return res;
}
};