insert_interval1.py

from typing import List
class Solution:
    def insertInterval(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]:
        def overlap(interval1, interval2):
            # print(f"interval1 {interval1}, interval2 {interval2}")
            return interval2[1] >= interval1[0] and interval2[0] <= interval1[1]
         
        result = []
        i = 0
        while i < len(intervals) and not overlap(intervals[i], newInterval)  and intervals[i] < newInterval:
            result.append(intervals[i])
            i += 1
        
        result.append(newInterval) 
        while i < len(intervals): 
            if not result or not overlap(result[-1], intervals[i]):
                result.append(intervals[i])
            else:
                result[-1][0] = min(result[-1][0], intervals[i][0])
                result[-1][1] = max(result[-1][1], intervals[i][1]) 
            i += 1
               
            
        return result
                
        
        
if __name__ == "__main__":
    sol = Solution()
    newInterval = [int(x) for x in input().split()]
    intervalsRange = int(input())
    intervals = [[int(x) for x in input().split()] for _ in range(intervalsRange)]
    result = sol.insertInterval(intervals, newInterval)
    for res in result:
        print(' '.join(str(num) for num in res))