首页 > itarticle > leetcode解题-merge intervals

leetcode解题-merge intervals

admin 11月 11, 2020 0

描述

Given a collection of intervals, merge all overlapping intervals.

For example,
Given [1,3],[2,6],[8,10],[15,18],
return [1,6],[8,10],[15,18].

分析

和[Insert Interval][1]很像，解法也很类似，先按start排序然后遍历数组前后合并。

代码

Python

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