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

//二分法查找
class Solution {
public:
    int minNumberInRotateArray(vector<int> rotateArray) {
        int left=0, right=rotateArray.size()-1;
        
        while (left < right) {
            int mid = (left + right) / 2;
            if (rotateArray[mid] > rotateArray[right]) left = mid + 1;    //往右找
            else if (rotateArray[mid] < rotateArray[right]) right = mid;     //往左找
            else --right;    //右边依次左移保证不漏
        }
        
        return rotateArray[left];
    }
};