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

public class Solution {
    public int minNumberInRotateArray(int [] array) {
        int low = 0;
        int high = array.length-1;
        while(low <= high){
            int mid = low + ((high - low )>> 1);
            if(array[mid] > array[high]){
                low = mid + 1;
            }else if(array[mid] < array[high]){
                high = mid;
            }else{
                high--;
            }
        }
        return array[low];
    }
}