# class Interval:
# def __init__(self, a=0, b=0):
# self.start = a
# self.end = b
#
# 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
#
#
# @param intervals Interval类一维数组
# @return Interval类一维数组
#
class Solution:
def merge(self , intervals: List[Interval]) -> List[Interval]:
# write code here
intervals.sort(key=lambda x: x.start)
n=len(intervals)
if n==0:return intervals
cur=intervals[0]
i=1
ans=[]
while i<n:
nxt=intervals[i]
if nxt.start<=cur.end:
cur.end=max(nxt.end,cur.end)
else:
ans.append(cur)
cur=nxt
i+=1
ans.append(cur)
return ans