[leetcode sort]56. Merge Intervals

 

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].

合并重叠区间

class Solution(object):
    def merge(self, intervals):
        """
        :type intervals: List[Interval]
        :rtype: List[Interval]
        """
        res = []
        for v in sorted(intervals,key=lambda x:x.start):
            if res and v.start <= res[-1].end:
                res[-1].end = max(res[-1].end,v.end)
            else:
                res.append(v)     #or res += i,
        return res