56. Merge Intervals

56. Merge Intervals

Medium

8188400Add 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

class Solution:
    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
        """
        print(Solution().merge([[15, 18], [1, 3], [2, 6], [8, 10]]))
        print(Solution().merge([[1, 4], [4, 5]]))
        print(Solution().merge([[1, 3], [5, 7], [5, 6]]))
        print(Solution().merge([[1, 4], [5, 6]]))

        解题思路：将区间列表按第一个元素从小到大排序，然后依次合并
        时间复杂度：O(nlogn),空间复杂度：O(1)
        """
        # 默认第一个元素排序，如果是指定第二个元素排序，则为 intervals.sort(key=takeSecond)
        intervals.sort()
        index = 0
        for i in range(1, len(intervals)):
            if intervals[i][0] - intervals[index][1] > 0:
                intervals[index + 1] = intervals[i]
                index += 1
            else:
                intervals[index][1] = max(intervals[index][1], intervals[i][1])
        return intervals[:index + 1]