LeetCode 剑指 Offer 11. 旋转数组的最小数字（二分法，C++）

题目链接

C++:

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