LC 0153 [M] Find Minimum in Rotated Sorted Array - ALawliet/algorithms GitHub Wiki

first binary search

class Solution:
    def findMin(self, nums: List[int]) -> int:
        l, r = 0, len(nums) - 1
        while l < r:
            m = (l + r) // 2
            if nums[m] > nums[r]:
                l = m + 1
            else:
                r = m
        return nums[l]