leetcode153. 寻找旋转排序数组中的最小值

class Solution {
    int min = Integer.MAX_VALUE;
    public int findMin(int[] nums) {
        //每一次分都可以将数组分为一个有序和一个无序的，每一次都取有序的那个的最小值，并继续比较无序子数组
        findMIn(nums,0,nums.length-1);
        return min;
    }

    public void findMIn(int[] nums,int start,int end){
        if(start > end)
            return;
        if(start == end){
            min = Math.min(min,nums[start]);
            return;
        }
        int mid = (start + end) / 2;
        //左边start~mid,右边mid+1~end
        if(nums[start] < nums[mid]){
            min = Math.min(min,nums[start]);
            findMIn(nums,mid+1,end);
        }else{
            min = Math.min(min,nums[mid+1]);
            findMIn(nums,start,mid);
        }
    }
}