class Solution: def merge(self, intervals: List[List[int]]) -> List[List[int]]: result = [] if len(intervals) == 0: return result intervals.sort(key = lambda x: x[0]) result.append(intervals[0]) for i in range(1, len(intervals)): if result[-1][1] >= intervals[i][0]: result[-1][1] = max(result[...