forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathyyyyyyyyyKim.py
More file actions
25 lines (18 loc) ยท 845 Bytes
/
yyyyyyyyyKim.py
File metadata and controls
25 lines (18 loc) ยท 845 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
class Solution:
def insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]:
# ์๊ฐ๋ณต์ก๋ O(n log n), ๊ณต๊ฐ๋ณต์ก๋ O(n)
# newInterval ์ถ๊ฐํ๊ณ ์ ๋ ฌ
intervals.append(newInterval)
intervals.sort()
answer = [intervals[0]]
for i in range(1, len(intervals)):
prev = answer[-1]
curr = intervals[i]
# ๋ณํฉํ๊ธฐ
# answer์ ๋ ๊ฐ๋ณด๋ค ํ์ฌ์ ์์๊ฐ์ด ๋ ์์ผ๋ฉด ๊ฒน์น๋ ๊ฒ -> ํ์ฌ์ ๋๊ฐ๊ณผ answer์ ๋๊ฐ ์ค ๋ ํฐ ๊ฐ์ผ๋ก ๋ณํฉ
if curr[0] <= prev[1]:
prev[1] = max(prev[1], curr[1])
# ๊ฒน์น์ง ์์ผ๋ฉด ํ์ฌ๊ฐ์ answer์ ์ถ๊ฐ
else:
answer.append(curr)
return answer