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

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param nums int整型vector 
     * @return int整型
     */
    int minNumberInRotateArray(vector<int>& nums) {
        // write code here
        int len = nums.size();
        return findmin(nums, 0, len-1);
    
        
    }

    int findmin(vector<int>& nums,int left,int right){
        if(right-left==1){
            return nums[left]<nums[right]?nums[left]:nums[right];
        }else if(right==left){
            return nums[right];
        }
        int mid = (left + right)/2;
        int min;
        if(nums[mid]>nums[right]){//最小值在右边
        min = findmin(nums, mid+1, right);
        }else if(nums[mid]<nums[right]){//最小值在左边
        min = findmin(nums, left, mid);
        }else{//最小值不确定在左还是右区间，两个去间都算然后比较大小
        int le_min = findmin(nums,left,mid);
        int ri_min = findmin(nums,mid+1,right);
        min = le_min<=ri_min?le_min:ri_min;   
        
        }
        return min;
    }
};