find-minimum-in-rotated-sorted-array solution

Author: sejineer

find-minimum-in-rotated-sorted-array/sejineer.py

@@ -0,0 +1,15 @@
+"""
+시간 복잡도: O(logN)
+공간 복잡도: O(1)
+"""
+class Solution:
+    def findMin(self, nums: List[int]) -> int:
+        start, end = 0, len(nums) - 1
+
+        while start < end:
+            mid = (start + end) // 2
+            if nums[mid] > nums[end]:
+                start = mid + 1
+            else:
+                end = mid
+        return nums[start]