Leetcode之Insert Interval

最新推荐文章于 2025-08-18 21:45:06 发布

原创最新推荐文章于 2025-08-18 21:45:06 发布 · 123 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

leetcode和机试题专栏收录该内容

509 篇文章

订阅专栏

本文深入解析了在已排序的非重叠区间集合中插入新区间并进行必要合并的算法实现。通过具体示例展示了如何有效地处理区间重叠，确保结果集的正确性和效率。适用于理解和实现区间操作的场景。

摘要生成于 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:

Input: intervals = [[1,3],[6,9]], newInterval = [2,5]
Output: [[1,5],[6,9]]

Example 2:

Input: intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]
Output: [[1,2],[3,10],[12,16]]
Explanation: Because the new interval [4,8] overlaps with [3,5],[6,7],[8,10]

代码：

class Solution {
public:
    vector<Interval> insert(vector<Interval>& intervals, Interval newInterval) {
        	vector<Interval> res;
	intervals.push_back(newInterval);

	if (intervals.size() == 1)return intervals;

	sort(intervals.begin(), intervals.end(), [](Interval &a, Interval& b) {return a.start < b.start; });
	
	int len = intervals.size();
	res.push_back(intervals[0]);

	for (int i = 1; i < len; i++) {
		if (res.back().end >= intervals[i].start) {
			res.back().end = max(res.back().end, intervals[i].end);
		}
		else {
			res.push_back(intervals[i]);
		}
	}

	return res;
    }
};

想法：结合以前学的知识点