Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Recursion solution in Creative category for Merge Intervals by Lemmi
def merge_intervals(inters):
if len(inters) <= 1:
return inters
if inters[1][0] > inters[0][1] + 1:
return [inters[0]] + merge_intervals(inters[1:])
return merge_intervals([(inters[0][0], max(inters[0][1], inters[1][1]))] + inters[2:])
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')
Aug. 1, 2017
