#56

Merge Intervals

specialist · 845 · lc medium +31 · verified · 51.3% accepted · 24,495 likes · top 40%

Description

Given intervals where intervals[i] = [starti, endi], merge all overlapping intervals and return the resulting array of non-overlapping intervals that covers the same total range.

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] overlap, 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.

Example 3:

Input: intervals = [[4,7],[1,4]]

Output: [[1,7]]

Explanation: Intervals [1,4] and [4,7] are considered overlapping.

Code

1

2

3

class Solution:
    def merge(self, intervals: List[List[int]]) -> List[List[int]]:

class Solution:
    def merge(self, intervals: List[List[int]]) -> List[List[int]]: