Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).
You may assume that the intervals were initially sorted according to their start times.
Example 1:
Given intervals [1,3],[6,9]
, insert and merge [2,5]
in as [1,5],[6,9]
.
Example 2:
Given [1,2],[3,5],[6,7],[8,10],[12,16]
, insert and merge [4,9]
in as [1,2],[3,10],[12,16]
.
This is because the new interval [4,9]
overlaps with [3,5],[6,7],[8,10]
.
思路:将与newInterval重叠的区间与newInterval合并,然后只需将newInterval和没有与newInterval重叠的区间返回
代码:
/**
* 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> insert(vector<Interval> &intervals, Interval newInterval) {
vector<Interval> res;
int i=0;
for(;i<intervals.size() && intervals[i].end<newInterval.start;i++){
res.push_back(intervals[i]);
}
if(i==intervals.size()){
res.push_back(newInterval);
return res;
}
newInterval.start=min(newInterval.start,intervals[i].start);
for(;i<intervals.size() && intervals[i].start<=newInterval.end;i++){
newInterval.end=max(intervals[i].end,newInterval.end);
}
res.push_back(newInterval);
for(;i<intervals.size();i++){
res.push_back(intervals[i]);
}
return res;
}
};