题目链接 此题看题解:题解 class Solution: def merge(self, intervals: List[List[int]]) -> List[List[int]]: intervals.sort() res=[intervals[0]] for left,right in intervals[1:]: if res[-1][1]<left: res.append([left,right]) else: res[-1][1]=max(right,res[-1][1]) return res