# 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 ):
# write code here
intervals.sort(key=lambda x:x.start)
res = []
for i in intervals:
if not res or i.start>res[-1].end:
res.append(i)
else:
res[-1].end = max(res[-1].end,i.end)
return res
京公网安备 11010502036488号