57. Insert Interval

57. Insert Interval

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].

class Solution:
    def insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]:
        i = len(intervals)-1
        k = i+1
        while i >= 0:
            if newInterval[0] <= intervals[i][0]:
                k = i
            i -= 1
        intervals.insert(k, newInterval)

        i = 0
        while (i+1) < len(intervals):
            A = intervals[i]
            B = intervals[i+1]

            if (max(A[1],A[0],B[1],B[0]) - min(A[1],A[0],B[1],B[0])) <= (A[1]-A[0]+B[1]-B[0]):
                intervals.remove(A)
                B[0], B[1] = min(A[1],A[0],B[1],B[0]), max(A[1],A[0],B[1],B[0])
                continue

            i += 1

        return intervals