Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Uncategorized category for Merge Intervals by ssk8
def merge_intervals(intervals):
if not intervals: return []
merged = [intervals[0]]
for i, interval in enumerate(intervals):
if interval[0] > merged[-1][1] + 1: merged.append(interval)
elif (interval[0] - 1) <= merged[-1][1] and interval[1] > merged[-1][1]: merged[-1] = (merged[-1][0], interval[1])
return merged
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert merge_intervals([(1, 4), (2, 6), (8, 10), (12, 19)]) == [(1, 6), (8, 10), (12, 19)], "First"
assert merge_intervals([(1, 12), (2, 3), (4, 7)]) == [(1, 12)], "Second"
assert merge_intervals([(1, 5), (6, 10), (10, 15), (17, 20)]) == [(1, 15), (17, 20)], "Third"
print('Done! Go ahead and Check IT')
May 24, 2018
