• 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.s0056_merge_intervals.readme.md Maven / Gradle / Ivy

56\. Merge Intervals

Medium

Given an array of `intervals` where intervals[i] = [starti, endi], merge all overlapping intervals, and return _an array of the non-overlapping intervals that cover all the intervals in the input_.

**Example 1:**

**Input:** intervals = \[\[1,3\],\[2,6\],\[8,10\],\[15,18\]\]

**Output:** \[\[1,6\],\[8,10\],\[15,18\]\]

**Explanation:** Since intervals \[1,3\] and \[2,6\] overlaps, merge them into \[1,6\]. 

**Example 2:**

**Input:** intervals = \[\[1,4\],\[4,5\]\]

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

**Explanation:** Intervals \[1,4\] and \[4,5\] are considered overlapping. 

**Constraints:**

*   1 <= intervals.length <= 104
*   `intervals[i].length == 2`
*   0 <= starti <= endi <= 104