algorithms-python/array/merge_intervals.py at master · izanbf1803/algorithms-python · GitHub

40 lines (35 loc) · 968 Bytes

"""

Given a collection of intervals, merge all overlapping intervals.

For example,

Given [1,3],[2,6],[8,10],[15,18],

return [1,6],[8,10],[15,18].

"""

# Definition for an interval.

class Interval(object):

def __init__(self, s=0, e=0):

self.start = s

self.end = e

def merge(intervals):

"""

:type intervals: List[Interval]

:rtype: List[Interval]

"""

out = []

for i in sorted(intervals, key=lambda i: i.start):

if out and i.start <= out[-1].end:

out[-1].end = max(out[-1].end, i.end)

else:

out += i,

return out

def print_intervals(intervals):

res = []

for i in intervals:

res.append('['+str(i.start)+','+str(i.end)+']')

print("".join(res))

if __name__ == "__main__":

given = [[1,3],[2,6],[8,10],[15,18]]

intervals = []

for l, r in given:

intervals.append(Interval(l,r))

print_intervals(intervals)

print_intervals(merge(intervals))

Expand file tree