overlapping intervals

overlapping_intervals.py

def interval_overlap(i1, i2):
    if i1.end >= i2.start:
        return True
    else:
        return False

def merge_interval(i1, i2):
    return Interval(s=min(i1.start, i2.start), e=max(i1.end, i2.end))

class Solution:
    def merge(self, intervals):
        """
        :type intervals: List[Interval]
        :rtype: List[Interval]
        """
        result = []
        intervals.sort(key=lambda interval: interval.start)
        for i in range(len(intervals)):
            if len(result) > 0:
                if interval_overlap(result[-1], intervals[i]):
                    result[-1] = merge_interval(result[-1], intervals[i])
                else:
                    result.append(intervals[i])
            else:
                result.append(intervals[i])


        return result