LintCode:合并区间

最新推荐文章于 2019-05-26 15:57:23 发布

原创最新推荐文章于 2019-05-26 15:57:23 发布 · 467 阅读

0 ·

CC 4.0 BY-SA版权

lintcode 同时被 2 个专栏收录

139 篇文章

订阅专栏

python

116 篇文章

订阅专栏

本文介绍了一种有效的合并区间算法。通过快速排序实现区间排序，之后遍历这些区间并合并重叠部分，最终得到一个合并后的区间列表。适用于解决各种与区间合并相关的问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

LintCode:合并区间

先排序，再逐个合并


"""
Definition of Interval.
class Interval(object):
    def __init__(self, start, end):
        self.start = start
        self.end = end
"""

class Solution:
    # @param intervals, a list of Interval
    # @return a list of Interval
    def merge(self, intervals):
        # write your code here
        if len(intervals) == 0 or len(intervals) <= 1:
            return intervals
        self.L = intervals
        self.quick_sort(self.L, 0, len(intervals)-1)
        ans = []
        while len(self.L) > 1:
            while len(self.L) > 1 and self.L and self.L[0].end >= self.L[1].start:
                if self.L[0].end <= self.L[1].end:
#                    print 'Ok'
                    self.L[0].end = self.L[1].end
                    self.L.remove(self.L[1])
                else:
                    self.L.remove(self.L[1])
            ans.append(self.L[0])
            self.L.remove(self.L[0])
        if self.L:
            ans.append(self.L[0])
        return ans


    def quick_sort(self, L, low, high):
        if low >= high:
            return
        i = low
        j = high
        tmp = L[i]
        while i < j:
            while i < j and L[j].start >= tmp.start:
                j -= 1
            L[i] = L[j]
            while i < j and L[i].start <= tmp.start:
                i += 1
            L[j] = L[i]
        L[i] = tmp
        self.quick_sort(L, low, i-1)
        self.quick_sort(L, i+1, high)