[Leetcode 57] Insert Interval

https://leetcode.com/problems/insert-interval/description/?envType=study-plan-v2&envId=top-interview-150

1) 코드

class Solution:
    def insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]:
        
        answer = [] 

        intervals.append(newInterval)
        intervals.sort(key=lambda x:x[0])
       
        currStart = intervals[0][0]
        currEnd = intervals[0][1]

        for i in range(1, len(intervals)):
            start = intervals[i][0]
            end = intervals[i][1]

            if currEnd >= start:
                currStart = min(currStart, start)
                currEnd = max(currEnd, end)
                continue 
            else:
                answer.append([currStart, currEnd])
                currStart = start
                currEnd = end 

        answer.append([currStart, currEnd])

        return answer 

2) 해설

• https://leetcode.com/problems/merge-intervals/
  Merge Interval과 매우 비슷한 문제이므로,
  같은 아이디어를 적용해서 문제를 풀 수 있다.