Solve : Find Minimum In Rotated Sorted Array

Author: printjin-gmailcom

find-minimum-in-rotated-sorted-array/printjin-gmailcom.py

@@ -0,0 +1,12 @@
+from typing import List
+
+class Solution:
+    def findMin(self, nums):
+        left, right = 0, len(nums) - 1
+        while left < right:
+            mid = (left + right) // 2
+            if nums[mid] > nums[right]:
+                left = mid + 1
+            else:
+                right = mid
+        return nums[left]