class Solution:
def merge(self, intervals: List[List[int]]) -> List[List[int]]:
length = len(intervals)
if length < 2: return intervals
intervals.sort()
l, r = intervals[0]
res = []
for i in range(1, length):
s, e = intervals[i]
if s <= r:
r = max(e, r)
else:
res.append([l, r])
l, r = s, e
res.append([l, r])
return res版权声明：本文为real_lisa原创文章，遵循CC 4.0 BY-SA版权协议，转载请附上原文出处链接和本声明。