← 返回 optiver 的题目列表Merge Overlapping Intervals
类型：online_judge
Given an array of intervals intervals where intervals[i] = [start_i, end_i], merge all overlapping intervals and return an array of the non-overlapping intervals that cover all intervals in the input.
Input (stdin)
One line: 2D array intervals (e.g., [[1,3],[2,6],[8,10],[15,18]])
Output (stdout)
One line: merged non-overlapping intervals (sorted by start ascending)
Constraints
1 <= len(intervals) <= 10^4
intervals[i].length == 2
0 <= start_i <= end_i <= 10^4
Example
Input: [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Example
Input
[[1,3],[2,6],[8,10],[15,18]]
Output
[[1, 6], [8, 10], [15, 18]]