leetcode-insert interval-优快云博客

本文链接：https://blog.youkuaiyun.com/cs_yinger/article/details/31739221

本文介绍了一种在已排序的非重叠区间中插入新区间并进行必要合并的方法。通过两个示例展示了如何将新区间插入到现有区间列表中，并在发生重叠时合并区间。文章还提供了一个实现思路及相应的C++代码片段。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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].

思路：查找合适的插入位置（可考虑二分查找提高效率），再利用merge函数合并（超时）,参考他人思路：开辟空间换取时间效率

代码：

vector<Interval> insert(vector<Interval> &intervals, Interval newInterval)
{
vector<Interval> res;
int i=0;

for(i=0; i<intervals.size(); ++i)
{
if(newInterval.start > intervals[i].end)
{
res.push_back(intervals[i]);
}
else if(newInterval.end < intervals[i].start)
{
res.push_back(newInterval);
newInterval=intervals[i];
}
else
{
newInterval.start=min(newInterval.start,intervals[i].start);
newInterval.end=max(newInterval.end,intervals[i].end);
}
}
res.push_back(newInterval);
return res;
return intervals;
}