Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution:
- # @param intervals, a list of Interval
- # @return a list of Interval
- def merge(self, intervals):
- if intervals:
- intervals = sorted(intervals, key = lambda interval:interval.start)
- toRet = []
- pre = None
- for interval in intervals:
- if pre:
- if interval.start > pre.end:
- toRet.append(pre)
- pre = interval
- else:
- pre.end = max(interval.end,pre.end)
- else:
- pre = interval
- toRet.append(pre)
- return toRet
- else:
- return []
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement