class Solution {
public:
    int minNumberInRotateArray(vector<int> rotateArray) {
        if(rotateArray.size()==0)return 0;
        int left=0,right=rotateArray.size()-1,middle=-1;
        while(rotateArray[left]>=rotateArray[right])
        {
            if(right-left==1)
            {
                middle=right;
                break;
            }
            middle=((right-left)>>1)+left;//移位必须加括号
            if(rotateArray[middle]>=rotateArray[left])left=middle;
            else if(rotateArray[middle]<=rotateArray[left]) right=middle;
        }
        return rotateArray[middle];
    }
};