Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First: append or extend range solution in Speedy category for Merge Intervals by leggewie
def merge_intervals(intervals):
"""
Merge overlapped intervals.
"""
# special-case empty list
if not intervals: return []
m = [intervals[0]]
for interval in intervals:
if interval[0] > m[-1][1] + 1:
# start of interval is out of reach of last interval in m array
# add interval to m intervals array
m.append(interval)
else:
# increase range of last interval in m array
m[-1] = (m[-1][0], max(interval[1],m[-1][1]))
return m
June 29, 2021
Comments: