Solution

• 二分查找

class Solution {
public:
    int minNumberInRotateArray(vector<int> rotateArray) {
        int n = rotateArray.size();
        if (n == 0) return 0;
        int l = 0, r = n - 1;
        while (l < r) {
            int mid = l + ((r - l)>>1);
            // 二分查找，让 arr[mid] 和 target（右端值） 比较
            if (rotateArray[mid] < rotateArray[r]) r = mid;
            else if (rotateArray[mid] == rotateArray[r]) r = r - 1;
            else l = mid + 1;
        }
        return rotateArray[l];
    }
};