Question Title: Find Minimum in Rotated Sorted Array
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).
Find the minimum element. You may assume no duplicate exists in the array.
Input: [3,4,5,1,2] Output: 1
Input: [4,5,6,7,0,1,2] Output: 0
class Solution: def findMin(self, nums: List[int]) -> int: left, right = 0, len(nums) -1 # Keep searching the unsorted part while nums[left] > nums[right]: mid = left + (right - left) // 2 if nums[mid] > nums[right]: left = mid + 1 else: right = mid return nums[left]