leetcode：57. Insert Interval

Problem

Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).

You may assume that the intervals were initially sorted according to their start times.

Example 1:

Input: intervals = [[1,3],[6,9]], newInterval = [2,5]
Output: [[1,5],[6,9]]
Example 2:

Input: intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]
Output: [[1,2],[3,10],[12,16]]
Explanation: Because the new interval [4,8] overlaps with [3,5],[6,7],[8,10].
NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.

Solution

同#56一样，先排序再对比，利用newInterval保存耦合的结果

class Solution:
    def insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]:
        if not intervals:
            return [newInterval]
        if not newInterval:
            return intervals
        res = list()
        sort = list(sorted(intervals,key=lambda r:r[0]))
        for l in sort:
            if not newInterval:
                res.append(l)
            elif (l[1]>=newInterval[0] and l[0]<newInterval[1]) or (l[1]>newInterval[0] and l[0]<=newInterval[1]):
                newInterval[0] = min(newInterval[0],l[0])
                newInterval[1] = max(newInterval[1],l[1])
            elif newInterval[1]<l[0]:
                res.append(newInterval)
                res.append(l)
                newInterval = []
            else:
                res.append(l)
        if newInterval:
            res.append(newInterval)
        return res