题目描述
给出一组区间,请合并所有重叠的区间。
例如,
给出[10,30],[20,60],[80,100],[150,180],
返回[10,60],[80,100],[150,180].
/**
* 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:
vector<Interval> merge(vector<Interval> &intervals) {
vector<Interval> res;
sort(intervals.begin(), intervals.end(), [&](Interval a, Interval b){
if(a.start == b.start) return a.end<b.end;
return a.start<b.start;
});
if(intervals.empty()) return res;
res.push_back(intervals[0]);
for(int i = 1; i<intervals.size();++i){
if(intervals[i].start > res.back().end){
res.push_back(intervals[i]);
}else{
res.back().end = max(intervals[i].end, res.back().end);
}
}
return res;
}
};