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

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param nums int整型一维数组 
     * @return int整型
     */
    public int ans = -1;
    public int minNumberInRotateArray (int[] nums) {
        // write code here
        int first = 0, rear = nums.length-1;
        int mid = (first+rear)/2;
        ans = nums[mid];
        binarySearch(nums,first,rear);
        return ans;
    }
    public void binarySearch(int []nums,int first,int rear){
        if(first>rear){
            return ;
        }
        int mid = (first + rear) /2 ;
        if(nums[mid] < ans){
            ans = nums[mid];
        }
        binarySearch(nums,first,mid-1);
        binarySearch(nums,mid+1,rear);
    }
    
}