|
| 1 | +""" |
| 2 | +Constraints: |
| 3 | +- 0 <= intervals.length <= 10^4 |
| 4 | +- intervals[i].length == 2 |
| 5 | +- 0 <= starti <= endi <= 10^5 |
| 6 | +- intervals is sorted by starti in ascending order. |
| 7 | +- newInterval.length == 2 |
| 8 | +- 0 <= start <= end <= 10^5 |
| 9 | +
|
| 10 | +Time Complexity: O(n) |
| 11 | +- ๋ชจ๋ interval์ ํ ๋ฒ์ฉ๋ง ์ฒ๋ฆฌํจ |
| 12 | +
|
| 13 | +Space Complexity: O(n) |
| 14 | +- ์ต์
์ ๊ฒฝ์ฐ ๋ชจ๋ interval์ ๊ฒฐ๊ณผ ๋ฆฌ์คํธ์ ์ ์ฅ |
| 15 | +
|
| 16 | +ํ์ด๋ฐฉ๋ฒ: |
| 17 | +1. ์ธ ๋จ๊ณ๋ก ๊ตฌ๋ถํ์ฌ ์ฒ๋ฆฌ: |
| 18 | + - Step 1: newInterval๋ณด๋ค ์์ ์๋ intervals โ ๊ฒฐ๊ณผ์ ๋ฐ๋ก ์ถ๊ฐ |
| 19 | + - Step 2: newInterval๊ณผ ๊ฒน์น๋ intervals โ ๋ณํฉํ์ฌ ํ๋์ interval๋ก ๋ง๋ฆ |
| 20 | + - Step 3: newInterval๋ณด๋ค ๋ค์ ์๋ intervals โ ๊ฒฐ๊ณผ์ ๋ฐ๋ก ์ถ๊ฐ |
| 21 | +2. ๋ณํฉ ์กฐ๊ฑด: |
| 22 | + - ๋ interval์ด ๊ฒน์น๋ ์กฐ๊ฑด: intervals[i][0] <= mergedInterval[1] |
| 23 | + - ๋ณํฉ ์ ์์์ : min(mergedInterval[0], intervals[i][0]) |
| 24 | + - ๋ณํฉ ์ ๋์ : max(mergedInterval[1], intervals[i][1]) |
| 25 | +
|
| 26 | +๋
ธํธ: |
| 27 | +- ์ธ ๋จ๊ณ๋ก ๊ตฌ๋ถํ์ฌ ์ฒ๋ฆฌํ๋ ๊ฒ ์ฝ์ง ์์๋ค. ๋ค์์ ํ ๋ ์ค์ค๋ก ํด๊ฒฐํด๋ณผ ๊ฒ |
| 28 | +""" |
| 29 | +class Solution: |
| 30 | + def insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]: |
| 31 | + result = [] |
| 32 | + i = 0 |
| 33 | + n = len(intervals) |
| 34 | + |
| 35 | + while i < n and intervals[i][1] < newInterval[0]: |
| 36 | + result.append(intervals[i]) |
| 37 | + i += 1 |
| 38 | + |
| 39 | + merged_interval = newInterval |
| 40 | + while i < n and intervals[i][0] <= merged_interval[1]: |
| 41 | + merged_interval[0] = min(merged_interval[0], intervals[i][0]) |
| 42 | + merged_interval[1] = max(merged_interval[1], intervals[i][1]) |
| 43 | + i += 1 |
| 44 | + result.append(merged_interval) |
| 45 | + |
| 46 | + while i < n: |
| 47 | + result.append(intervals[i]) |
| 48 | + i += 1 |
| 49 | + |
| 50 | + return result |
0 commit comments