Leetcode: Insert Interval

最新推荐文章于 2026-06-15 12:05:19 发布

原创最新推荐文章于 2026-06-15 12:05:19 发布 · 133 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#algorithm #面试

Leetcode 专栏收录该内容

154 篇文章

订阅专栏

本文介绍了一种算法，用于在一个已排序的不重叠区间集合中插入一个新的区间，并在必要时进行合并。通过两个实例展示了如何将新区间正确地插入到现有区间中，并保持区间的排序及合并可能重叠的部分。

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

c++:

/**
 * Definition for an interval.
 * struct Interval {
 *     int start;
 *     int end;
 *     Interval() : start(0), end(0) {}
 *     Interval(int s, int e) : start(s), end(e) {}
 * };
 */
bool com(const Interval &p, const Interval &q) {
    return p.start < q.start;
}
class Solution {
public:
    vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
        vector<Interval> ret;
        int size = intervals.size();
        int i;
        intervals.push_back(newInterval);
        sort(intervals.begin(), intervals.end(), com);
        int start = intervals[0].start;
        int end = intervals[0].end;
        for(i = 1;i < size+1;i ++) {
            if(start <= intervals[i].start && intervals[i].start <= end) {
                end = max(end,intervals[i].end);
            } else {
                ret.push_back(Interval(start,end));
                start = intervals[i].start;
                end = intervals[i].end;
            }
        }
        ret.push_back(Interval(start,end));
        return ret;
    }
};