# Definition for an interval.
# class Interval(object):
# def __init__(self, s=0, e=0):
# self.start = s
# self.end = e
class Solution(object):
def comp(self, a, b):
if a.start>b.start:return 1
elif a.start==b.start:return 0
else : return -1
def merge(self, intervals):
"""
:type intervals: List[Interval]
:rtype: List[Interval]
"""
Len=len(intervals)
if Len<=1:return intervals
intervals.sort(self.comp)
ans=[]
cur=intervals[0]
for i in range(1,Len):
if intervals[i].start>cur.end:
ans.append(cur)
cur=intervals[i]
else:
cur=Interval(cur.start,max(intervals[i].end,cur.end))
if i+1==Len:ans.append(cur)
return ans