题解 | #旋转数组的最小数字#

#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param rotateArray int整型一维数组 
# @return int整型
#
class Solution:
    def minNumberInRotateArray(self , rotateArray: List[int]) -> int:
        # write code here
        left,right = 0 ,len(rotateArray)-1
        while left <= right:
            mid = (left + right ) // 2
            if rotateArray[mid] > rotateArray[right]:
                #在右边  分治
                left = mid + 1
            elif rotateArray[mid] == rotateArray[right]:
                right  -=  1
            elif rotateArray[mid] < rotateArray[right]:
                right -= 1
        return rotateArray[mid]