insert-interval

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an array of non-overlapping intervals <code>intervals</code> where <code>intervals[i] = [starti, endi]</code> represent the start and the end of the <code>ith</code> interval and <code>intervals</code> is sorted in ascending order by <code>starti</code>. You are also given an interval <code>newInterval = [start, end]</code> that represents the start and end of another interval.

Insert <code>newInterval</code> into <code>intervals</code> such that <code>intervals</code> is still sorted in ascending order by <code>starti</code> and <code>intervals</code> still does not have any overlapping intervals (merge overlapping intervals if necessary).

Return <code>intervals</code> after the insertion.

Note that you don&#39;t need to modify <code>intervals</code> in-place. You can make a new array and return it.

&nbsp;
Example 1:

<pre>
Input: intervals = [[1,3],[6,9]], newInterval = [2,5]
Output: [[1,5],[6,9]]
</pre>

Example 2:

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

&nbsp;
Constraints:

<ul>
	<li><code>0 &lt;= intervals.length &lt;= 104</code></li>
	<li><code>intervals[i].length == 2</code></li>
	<li><code>0 &lt;= starti &lt;= endi &lt;= 105</code></li>
	<li><code>intervals</code> is sorted by <code>starti</code> in ascending order.</li>
	<li><code>newInterval.length == 2</code></li>
	<li><code>0 &lt;= start &lt;= end &lt;= 105</code></li>
</ul>

insert

Insert Interval

Merge Intervals

merge-intervals

合并区间

Range Module

range-module

Range 模块

Count Integers in Intervals

count-integers-in-intervals

统计区间中的整数数目

Array

给你一个 无重叠的 ，按照区间起始端点排序的区间列表 <code>intervals</code>，其中&nbsp;<code>intervals[i] = [starti, endi]</code>&nbsp;表示第&nbsp;<code>i</code>&nbsp;个区间的开始和结束，并且&nbsp;<code>intervals</code>&nbsp;按照&nbsp;<code>starti</code>&nbsp;升序排列。同样给定一个区间&nbsp;<code>newInterval = [start, end]</code>&nbsp;表示另一个区间的开始和结束。

在&nbsp;<code>intervals</code> 中插入区间&nbsp;<code>newInterval</code>，使得&nbsp;<code>intervals</code>&nbsp;依然按照&nbsp;<code>starti</code>&nbsp;升序排列，且区间之间不重叠（如果有必要的话，可以合并区间）。

返回插入之后的&nbsp;<code>intervals</code>。

注意 你不需要原地修改&nbsp;<code>intervals</code>。你可以创建一个新数组然后返回它。

&nbsp;

示例&nbsp;1：

<pre>
输入：intervals = [[1,3],[6,9]], newInterval = [2,5]
输出：[[1,5],[6,9]]
</pre>

示例 2：

<pre>
输入：intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]
输出：[[1,2],[3,10],[12,16]]
解释：这是因为新的区间 <code>[4,8]</code> 与 <code>[3,5],[6,7],[8,10]</code>&nbsp;重叠。
</pre>

&nbsp;

提示：

<ul>
	<li><code>0 &lt;= intervals.length &lt;= 104</code></li>
	<li><code>intervals[i].length == 2</code></li>
	<li><code>0 &lt;=&nbsp;starti &lt;=&nbsp;endi &lt;= 105</code></li>
	<li><code>intervals</code> 根据 <code>starti</code> 按 升序 排列</li>
	<li><code>newInterval.length == 2</code></li>
	<li><code>0 &lt;=&nbsp;start &lt;=&nbsp;end &lt;= 105</code></li>
</ul>