• Home
• com.github.javadev
• leetcode-in-java11
• 1.4
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0001_0100.s0057_insert_interval.readme.md Maven / Gradle / Ivy

57\. Insert Interval

Medium

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

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

Return `intervals` _after the insertion_.

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

**Example 3:**

**Input:** intervals = \[\], newInterval = \[5,7\]

**Output:** \[\[5,7\]\] 

**Example 4:**

**Input:** intervals = \[\[1,5\]\], newInterval = \[2,3\]

**Output:** \[\[1,5\]\] 

**Example 5:**

**Input:** intervals = \[\[1,5\]\], newInterval = \[2,7\]

**Output:** \[\[1,7\]\] 

**Constraints:**

*   0 <= intervals.length <= 104
*   `intervals[i].length == 2`
*   0 <= starti <= endi <= 105
*   `intervals` is sorted by starti in **ascending** order.
*   `newInterval.length == 2`
*   0 <= start <= end <= 105