Insert Interval

最新推荐文章于 2020-11-04 20:53:35 发布

Godkiller123

最新推荐文章于 2020-11-04 20:53:35 发布

阅读量302

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/u012734829/article/details/41848309

版权

LeetCode 专栏收录该内容

90 篇文章 0 订阅

订阅专栏

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

插入一个区间再进行合并与meger interval基本一致只要将插入的interval按序插入到原intervals即可插入代码如下：

int i=0;       
        for(;i<intervals.size();i++){
            if(newInterval.start<=intervals.get(i).start){
                intervals.add(i,newInterval);
                break;
            } 
        }
        if(i==intervals.size()) intervals.add(newInterval);

其余与meger interval完全一致