旋转数组的最小数字java实现

public class Solution {
    public int minNumberInRotateArray(int [] array) {
        int low=0;
        int high=array.length-1;
        int mid=0;
 
        while(low<high){
            if (array[low]<array[high])
                return array[low];//10111情况
            mid=low+(high-low)/2;
            if(array[mid]>array[low])
                low=mid+1;//数小的和中间换
            else if(array[mid]<array[high])
                high=mid;
            else low++;//相等的时候
        }
        return array[low];
    }
}