/**
* 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 cmp(Interval &a,Interval &b){
if(a.start==b.start) return a.end<b.end;
return a.start<b.start;
}
vector<Interval> merge(vector<Interval> &intervals) {
vector<Interval> res;
if(intervals.size()==0) return res;
else if(intervals.size()==1) {res.push_back(intervals[0]);return res;}
sort(intervals.begin(),intervals.end(),cmp);//类型不同。要用cmp
Interval temp;
int l=intervals[0].start,r=intervals[0].end;
for(int i=1;i<intervals.size();i++){
if(r>=intervals[i].start){//需要合并
r=max(r,intervals[i].end);
//temp.start=l;temp.end=r;
//res.push_back(temp);
//上面两行不对,因为此时不确定后面一个区间是否要和当前这个区间合并
}else {//先保存独立的区间,再更新左右指针
temp.start=l;temp.end=r;
res.push_back(temp);
l=intervals[i].start;
r=intervals[i].end;
}
}
temp.start=l;temp.end=r;
res.push_back(temp);
return res;
}
};
12-13
200
11-03
571