LeetCode-56 Merge Intervals

Description

Given a collection of intervals, merge all overlapping intervals.

NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.

Example

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.

Submissions

本题解题思路首先判断输入的intervals列表是否为空，若为空则直接返回空。否则利用sort函数对intervals列表按首元素进行排序操作。然后初始化res列表为intervals列表的第一个列表元素，遍历intervals列表的其他元素，当res中最后一个列表的尾元素大于等于遍历的当前列表的第一个元素时，则说明区间重叠，则将res中最后一个列表的尾元素赋值为res最后一个列表的尾和遍历的当前列表的尾元素中的最大值,即合并区间。否则直接将遍历的列表添加到res中。最后返回res列表即可。

实现代码如下：

class Solution:
    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
        if intervals == []:
            return []
        intervals.sort(key=lambda x:x[0])  
        res = [intervals[0]]
        for i in intervals[1:]:
            if res[-1][-1]>=i[0]:
                res[-1][-1]= max(res[-1][-1],i[-1])
            else:
                res.append(i)
        return res