Given a list of intervals, each represented as a pair of integers [start, end], merge all overlapping intervals and return a new list of non-overlapping intervals. Each interval is inclusive of its start and end times.
Example 1:
Input: intervals = [[1, 3], [2, 6], [8, 10], [15, 18]]
Output: [[1, 6], [8, 10], [15, 18]]
Example 2:
Input: intervals = [[1, 4], [4, 5]]
Output: [[1, 5]]
0 <= intervals.length <= 10^4-10^4 <= start <= end <= 10^4intervals = [[1, 3], [2, 6], [8, 10], [15, 18]]Output[[1, 6], [8, 10], [15, 18]]WhyThe intervals [1, 3] and [2, 6] overlap, so they are merged into [1, 6]. The others do not overlap.intervals = [[1, 4], [4, 5]]Output[[1, 5]]WhyThe intervals [1, 4] and [4, 5] touch at 4, thus they are merged into [1, 5].0 <= intervals.length <= 10^4-10^4 <= start <= end <= 10^4def merge_intervals(intervals: list[list[int]]) -> list[list[int]]:
