劍指Offer 11.旋轉數組的最小數字(二分法)

題解

代碼：

class Solution {
    public int minArray(int[] numbers) {
          int start = 0, end = numbers.length-1,mid=0;
          while(start < end){
            mid = start + (end - start)/2;
            if(numbers[mid]<numbers[end]){
                end = mid;
            }else if(numbers[mid]>numbers[end]){
                start = mid+1;
            }else if(numbers[mid]==numbers[end]){
                end--;
            }
          }
    return numbers[start];
    }
}