Skip to main content

🔴 剑指 Offer 11. 旋转数组的最小数字

LeetCode 提示

题目难度 困难

原题链接 🔗 leetcode

题解 1.抄的.py#

class Solution:    def minArray(self, numbers: List[int]) -> int:        left, right = 0, len(numbers)-1        while left <= right:            mid = (left+right)//2            if numbers[mid] < numbers[right]:                right = mid            elif numbers[mid] > numbers[right]:                left = mid+1            else:                right -= 1        return numbers[left]