【二分法】旋转数组的最小数字

import java.util.ArrayList;
public class Solution {
    public int minNumberInRotateArray(int [] array) {
     if(array.length==0)return 0;
     int left=0;
     int right=array.length-1;
     while(leftarray[right])left=mid+1;
         else if(array[mid]