56. Merge Intervals

56. Merge Intervals

Medium

12690504Add to ListShare

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

Accepted

1.4M

Submissions

3M

class Solution:
    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
        ans =[]
        for beg,end in sorted(intervals):
            if not ans or ans[-1][1]<beg:
                ans+=[[beg,end]]
            else:
                ans[-1][1]=max(end,ans[-1][1])
        
        return ans