剑指奥否 二分查找

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