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

import java.util.*;


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