2023.01.16 Today's Challenge

https://leetcode.com/problems/insert-interval/

Insert Interval - LeetCode

머지 인터벌을 활용해서 문제 풂

class Solution:
    def insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]:
        insert_i = bisect_left(intervals, newInterval)
        intervals.insert(insert_i, newInterval)
        stack = []
        for s,e in intervals:
            if stack and stack[-1][1] >= s:
                last_s, last_e = stack.pop()
                stack.append([last_s, max(last_e,e)])
            else:
                stack.append([s,e])
        return stack