题目
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].
思路
将给定的Interval插入到数组中,然后进行合并,合并思路参照
http://blog.csdn.net/wanna_wsl/article/details/65939241
代码
bool cmp(Interval i1, Interval i2) {
if(i1.start < i2.start)
return true;
else if(i1.start > i2.start)
return false;
else
return i1.end < i2.end;
}
class Solution {
public:
vector<Interval> insert(vector<Interval>& intervals, Interval newInterval) {
vector<Interval> res;
intervals.push_back(newInterval);
sort(intervals.begin(), intervals.end(), cmp);
res.push_back(intervals[0]);
for(int i=1; i<intervals.size(); i++) {
if(intervals[i].start > res[res.size()-1].end) {
res.push_back(intervals[i]);
} else {
int pend = max(intervals[i].end, res[res.size()-1].end);
res[res.size()-1] = Interval(res[res.size()-1].start, pend);
}
}
return res;
}
};