Skip to content

Commit 3da4563

Browse files
committed
feat: [Week 09-2] solve find minimum in rotated sorted array
1 parent 8089c42 commit 3da4563

File tree

1 file changed

+16
-0
lines changed

1 file changed

+16
-0
lines changed
Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
"""
2+
Solution:
3+
1) 순회하며 이전 값이 현재 값보다 크거나 같다면 현재 값이 최소값이다.
4+
2) 끝까지 돌아도 최소값이 없을 경우 첫번쨰 값이 최소값이다.
5+
Time: O(n)
6+
Space: O(1)
7+
"""
8+
9+
10+
class Solution:
11+
def findMin(self, nums: List[int]) -> int:
12+
for i in range(1, len(nums)):
13+
if nums[i - 1] >= nums[i]:
14+
return nums[i]
15+
16+
return nums[0]

0 commit comments

Comments
 (0)