Offer Penalty for surface prove safety questions. 11 --- --- minimum rotational array (dichotomy) .md

Min. 11 --- rotating array of interview questions to prove safety Offer-

1, the minimum value of the rotating array

https://leetcode-cn.com/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof/
dichotomy

    int minArray(vector<int>& numbers) {
        if(numbers.size() <= 0)
            return -1;

        int low = 0;
        int high = numbers.size()-1;
        int mid;

        while(low < high){

            mid = (low+high)>>1;
            if(numbers[mid] > numbers[high]){
                low = mid+1;
            }
            else if(numbers[mid] == numbers[high]){
                high --;
            }
            else{
                high = mid;
            }
        }

        return numbers[low];
    }