[Leetcode][python]Insert Interval/插入区间

class Solution(object):
    def insert(self, intervals, newInterval):
        """
        :type intervals: List[Interval]
        :type newInterval: Interval
        :rtype: List[Interval]
        """
        result = []
        if not intervals:
            return [newInterval]
        intervals.append(newInterval)
        intervals.sort(key = lambda x: x.start)
        result.append(intervals[0])
        for interval in intervals[1:]:
            prev = result[-1]
            if prev.end >= interval.start:
                prev.end = max(prev.end, interval.end)
            else:
                result.append(interval)
        return result

# Definition for an interval.
# class Interval(object):
#     def __init__(self, s=0, e=0):
#         self.start = s
#         self.end = e

class Solution(object):
    def insert(self, intervals, newInterval):
        """
        :type intervals: List[Interval]
        :type newInterval: Interval
        :rtype: List[Interval]
        """
        start, end = newInterval.start, newInterval.end
        left = list(filter(lambda x: x.end < start, intervals))
        right = list(filter(lambda x: x.start > end, intervals))
        print left, right
        if len(left) + len(right) != len(intervals):  # 如果左边和右边的数量相加不等于原数量，说明新区间与某个老区间有交叉，则需要合并
            start = min(start, intervals[len(left)].start)  # len(left)是分开后左边区间的后面一个
            end = max(end, intervals[-len(right) - 1].end)  # -len(right) - 1是分开后右边区间的前面一个

        return left + [Interval(start, end)] + right  # Interval是区间类，新建一个区间类