LeetCode - 56. Merge Intervals

56. Merge Intervals

class Solution:
    def merge(self, intervals: List[List[int]]) -> List[List[int]]:
        length = len(intervals)
        if length < 2: return intervals

        intervals.sort()

        l, r = intervals[0]
        res = []
        for i in range(1, length):
            s, e = intervals[i]
            if s <= r:
                r = max(e, r)
            else:
                res.append([l, r])
                l, r = s, e
        res.append([l, r])
        return res