Advertisement
Guest User

Untitled

a guest
Jan 28th, 2015
206
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.68 KB | None | 0 0
  1. class Solution:
  2. # @param intervals, a list of Interval
  3. # @return a list of Interval
  4. def merge(self, intervals):
  5. if intervals:
  6. intervals = sorted(intervals, key = lambda interval:interval.start)
  7. toRet = []
  8. pre = None
  9. for interval in intervals:
  10. if pre:
  11. if interval.start > pre.end:
  12. toRet.append(pre)
  13. pre = interval
  14. else:
  15. pre.end = max(interval.end,pre.end)
  16. else:
  17. pre = interval
  18. toRet.append(pre)
  19. return toRet
  20. else:
  21. return []
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement