【二分法】配列の最小数を回転させる

 

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(left<right){
         int mid=left+(right-left)/2;
         if(array[mid]>array[right])left=mid+1;
         else if(array[mid]<array[right])right=mid;
         else right--;
     }
        return array[right];
    }
}