Package g0001_0100.s0056_merge_intervals
Class Solution
java.lang.Object
g0001_0100.s0056_merge_intervals.Solution
56 - Merge Intervals.<p>Medium</p>
<p>Given an array of <code>intervals</code> where <code>intervals[i] = [start<sub>i</sub>, end<sub>i</sub>]</code>, merge all overlapping intervals, and return <em>an array of the non-overlapping intervals that cover all the intervals in the input</em>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> intervals = [[1,3],[2,6],[8,10],[15,18]]</p>
<p><strong>Output:</strong> [[1,6],[8,10],[15,18]]</p>
<p><strong>Explanation:</strong> Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> intervals = [[1,4],[4,5]]</p>
<p><strong>Output:</strong> <a href="1,5">1,5</a></p>
<p><strong>Explanation:</strong> Intervals [1,4] and [4,5] are considered overlapping.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= intervals.length <= 10<sup>4</sup></code></li>
<li><code>intervals[i].length == 2</code></li>
<li><code>0 <= start<sub>i</sub> <= end<sub>i</sub> <= 10<sup>4</sup></code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
merge
public int[][] merge(int[][] intervals)
-