leetcode56.Merge Intervals

原题链接https://leetcode.com/problems/merge-intervals/

56. Merge Intervals
    Medium

4152

283

Add to List

Share
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 considered overlapping.

class Solution:
    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
        if len(intervals) < 2:
            return intervals
        intervals = sorted(intervals,key = lambda x :x[0])
        res = []
        path = []
        i = 0
        while i < len(intervals):
            if path == []:
                path = intervals[i]
            else:
                if intervals[i][0] <= path[1]:
                    path[1] = max(intervals[i][1], path[1])
                else:
                    res.append(path)
                    path = intervals[i]
            i += 1
        res.append(path)
        return res