剑指 Offer 11. 旋转数组的最小数字

原题链接：剑指 Offer 11. 旋转数组的最小数字

 

solution:

        二分

class Solution {
public:
    int minArray(vector<int>& numbers) {
        int l = 0,r = numbers.size() - 1;
        while(l < r) {
            int mid = l + (r - l) / 2;
            if(numbers[mid] < numbers[r]) r = mid;
            else if(numbers[mid] > numbers[r]) l = mid + 1;
            else r--;
        }        
        return numbers[l];
    }
};