classSolution: defmerge(self, intervals): ifnot intervals: return [] intervals.sort() merged = [] l = len(intervals) m = intervals[0] for x in range(l-1): j = intervals[x+1] if m[1] >= j[0]: if m[1] <= j[1]: m = [m[0], j[1]] else: continue else: merged.append(m) m = j if m: merged.append(m) return merged