题目
解法
python
class Solution:
def merge(self, intervals: List[List[int]]) -> List[List[int]]:
# check empty case
if not intervals:
return []
intervals.sort(key=lambda x:x[0])
# initialize the start ans end for current merging case
start = intervals[0][0]
end = intervals[0][1]
ans = []
for i, interval in enumerate(intervals[1:]):
if interval[0]<=end:
end = max(end,interval[1])
start = min(start