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

二分查找

public class Solution {
    public int minNumberInRotateArray(int [] array) {
        int len = array.length;
        if(array == null || len == 0){
            return 0;
        }
        int left = 0;
        int right = len-1;
        while(left<right){
            int point = left + (right -left)/2;
            if(array[point]<array[right]){
                right = point;
            }else if(array[point]>array[right]) {
                left = point+1;
            }else{
                right-=1;
            }
        }

        return array[left];
    }
}