步骤:
1.先对vector排序。
2.再按要求合并。
用到的知识:sort存在于algorithm头文件中; vector的erase()的参数是迭代器。
C++代码:
/**
* Definition of Interval:
* classs Interval {
* int start, end;
* Interval(int start, int end) {
* this->start = start;
* this->end = end;
* }
*/
bool comp(const Interval& i1, const Interval &i2) {
return i1.start < i2.start;
}
class Solution{
public:
/**
* @param intervals: interval list.
* @return: A new interval list.
*/
vector<Interval> merge(vector<Interval> &intervals) {
std::sort(intervals.begin(), intervals.end(),comp);
//cout<<"sorted:"<<endl;
//print(intervals);
int i=1;
while(true) {
if (i>=intervals.size())
break;
if(intervals[i-1].end >= intervals[i].end){
//intervals[i-1].end = intervals[i].end;
intervals.erase(intervals.begin()+i);
}else if(intervals[i-1].end>=intervals[i].start){
intervals[i-1].end = intervals[i].end;
intervals.erase(intervals.begin()+i);
}else{
i++;
}
}
return intervals;
}
};