[Leetcode] 56. Merge Interval (Python)

@[TOC]([Leetcode] 56. Merge Interval (Python) - Medium)

题目大意 - 合并区间

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.

题目解析

• 创建一个列表存储答案，并对intervals排序，默认按照第一个元素排序。
• 遍历intervals，如果列表为空，就append一个interval进去。
• 之后将列表的最后一个区间的第二个元素与遍历的intervals的区间的第一个元素进行比较，如果前者大，就说明重叠，将该元素替换掉（注意：要与intervals中重合区间的第二个元素取最大值替换）。如果后者大，就表示没有重叠，继续append区间就好了。

代码

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

————————————————————————
📅 Date: 2020.Nov.18 - Germany
🐏 今天面试一个实习和毕设的职位，关于机器学习没有做过什么大的project，感觉自己好卡。