LeetCode Medium 56 合并间隔 Python

最新推荐文章于 2022-11-06 16:08:48 发布

咚咚咚Boom

最新推荐文章于 2022-11-06 16:08:48 发布

阅读量242

点赞数

分类专栏： OJ 算法 LeetCode

本文链接：https://blog.csdn.net/qq_28327765/article/details/85391364

版权

OJ 同时被 3 个专栏收录

75 篇文章 0 订阅

订阅专栏

算法

75 篇文章 0 订阅

订阅专栏

LeetCode

72 篇文章 0 订阅

订阅专栏

def merge(self, intervals):
    """
    算法：先排序，再merge
    MD,坑爹，interval居然是个对象，而不是题目中给出的样例那样的[1,2][3,4]?????
    然后就很好做了，根据interval.start进行排序，然后result的top做判断是否要进行合并，合并的条件是
    interval.left <= last_interval.end，因为已经根据start排过序了，所以只要判断这一个地方就oK

    """
    if intervals == []:
        return []
    intervals.sort(key=lambda x: x.start)
    result = []
    for interval in intervals:
        if result == []:
            result.append(interval)
            continue
        else:
            last_interval = result[-1]
            if interval.start <= last_interval.end:
                interval.start = min(interval.start, last_interval.start)
                interval.end = max(interval.end, last_interval.end)
                result.pop()
            result.append(interval)
    return result

def merge1(self, intervals):
    """

    Solution的写法，更加简洁
    """
    intervals.sort(key=lambda x: x.start)

    merged = []
    for interval in intervals:
        # if the list of merged intervals is empty or if the current
        # interval does not overlap with the previous, simply append it.
        if not merged or merged[-1].end < interval.start:
            merged.append(interval)
        else:
        # otherwise, there is overlap, so we merge the current and previous
        # intervals.
            merged[-1].end = max(merged[-1].end, interval.end)

    return merged