56. Merge Intervals

• Keep the merged interval and update the end points

class Solution(object):
    def merge(self, intervals):
        intervals.sort(key = lambda i:i[0])

        print(intervals)

        merged = [intervals[0]]

        for start, end in intervals[1:]:
            if start <= merged[-1][1]:
                merged[-1][1] = max(end, merged[-1][1])
            else:
                merged.append([start,end])

        return merged