【python3】leetcode 56. Merge Intervals （Medium）

最新推荐文章于 2020-05-03 19:57:01 发布

momottyy

最新推荐文章于 2020-05-03 19:57:01 发布

阅读量146

点赞数

分类专栏： leetcode python

本文链接：https://blog.csdn.net/maotianyi941005/article/details/86478888

版权

leetcode 同时被 2 个专栏收录

126 篇文章 0 订阅

订阅专栏

python

120 篇文章 0 订阅

订阅专栏

56. Merge Intervals （Medium）

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.

题意：合并重叠的时间间隔

注意

1 interval是一个class （c/c++：结构体

2 给的intervals不一定有序，我这个解法先按start时间排序sort

# Definition for an interval.
# class Interval:
#     def __init__(self, s=0, e=0):
#         self.start = s
#         self.end = e

class Solution:
    def merge(self, intervals):
        """
        :type intervals: List[Interval]
        :rtype: List[Interval]
        """
        intervals.sort(key=lambda x:x.start)
        if not intervals:return []
        merge = [[intervals[0].start,intervals[0].end]]
        for i in range(1,len(intervals)):
            if intervals[i].start<=merge[-1][1]:
                merge[-1][1] = max(merge[-1][1],intervals[i].end)
            else:      
                merge.append([intervals[i].start,intervals[i].end])
        return merge