LeetCode56. 合并区间

LeetCode56. 合并区间

Given a collection of intervals, merge all overlapping intervals.

Example 1:

Input: [[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: [[1,4],[4,5]]
Output: [[1,5]]
Explanation: Intervals [1,4] and [4,5] are considered overlapping.

class Solution:
    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
        if len(intervals) == 0: return []
        #以开始坐标，排序
        intervals = sorted(intervals, key = lambda x: x[0])
        res = [intervals[0]]
        for n in intervals[1:]:
        #如果最后一段的结尾不小于 当前区域的开始，merge
            if n[0] <= res[-1][-1]: res[-1][-1] = max(n[-1], res[-1][-1])
            else: res.append(n)
        return res