题目:
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]
.
题意把相交的集合合并。
按start排序,遍历的时候判断前后集合是否有相交,如果没有就把之前的集合输出。
/**
* 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(Interval a,Interval b)
{
return a.start<b.start;
}
class Solution {
public:
vector<Interval> merge(vector<Interval> &intervals) {
vector<Interval> result;
sort(intervals.begin(),intervals.end(),cmp);
int i,j,left=-1,right=-1,len=intervals.size();
for(i=0;i<len;++i)
{
if(intervals[i].start<=right)
{
right=max(right,intervals[i].end);
}
else
{
if(left!=-1)result.push_back(Interval(left,right));
left=intervals[i].start;
right=intervals[i].end;
}
}
if(left!=-1)result.push_back(Interval(left,right));
return result;
}
};