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.start和newInterval.end是否在给定区间内的情况,根据两者是否的判断可以得出总共4组方案,但是这样操作过后显示output limited exceed,至今也不明白为什么出现这种情况。没有办法,只有采用其他办法。经分析可以知道,
1)对于与给定区间newInterval完全没有交集的区间来说,在结果中还是应该按原本的区间插入进去的。
2)若有区间in与newInterval存在交集的话,我们可以将newInterval扩展为newInterval.start=min(in.start,newInterval.start),newInterval.end=max(in.end,newInterval.end),最后插入newInterval。这样我们就可以得到最终想要的结果了。
class Solution {
public:
vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
int i=0,n=intervals.size();
vector<Interval> res;
while(i<n&&newInterval.start>intervals[i].end)
res.push_back(intervals[i++]);
while(i<n&&newInterval.end>=intervals[i].start)
{
newInterval.end=max(intervals[i].end,newInterval.end);
newInterval.start=min(intervals[i].start,newInterval.start);
i++;
}
res.push_back(newInterval);
while(i<n)
res.push_back(intervals[i++]);
return res;
}
};