153.md

Find Minimum in Rotated Sorted Array

Description

link

---

Solution

Bi Binary Search

---

Code

O(logn)

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