Back
Sorting Techniques
Question 1 of 128% Complete
Medium
Complete merge-intervals after sorting by start
Sort intervals by start, then merge overlapping into output list.
def merge(intervals):
intervals.sort(key=lambda x: x[0])
res = []
for s, e in intervals:
if not res or :
res.append([s, e])
else:
res[-1][1] =
return res
Need a hint?
No overlap if current start is after last end.