56. Merge Intervals

最新推荐文章于 2022-05-08 10:00:00 发布

niunc

最新推荐文章于 2022-05-08 10:00:00 发布

阅读量67

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/niunc/article/details/81430551

版权

LeetCode 专栏收录该内容

185 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/merge-intervals/description/

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 considerred overlapping.

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

class Solution(object):
    def merge(self, intervals):
        """
        :type intervals: List[Interval]
        :rtype: List[Interval]
        """
        intervals.sort(key=lambda a: a.start)
        i = 0
        while i < len(intervals) - 1:
            if intervals[i].end >= intervals[i + 1].start and intervals[i].start <= intervals[i + 1].end \
                or intervals[i + 1].start <= intervals[i].end and intervals[i + 1].end >= intervals[i].start:
                intervals[i].end = max(intervals[i].end, intervals[i + 1].end)
                intervals[i].start = min(intervals[i].start, intervals[i + 1].start)
                del intervals[i + 1]
            else:
                i += 1

        return intervals