剑指 Offer 11. 旋转数组的最小数字

public int minArray(int[] numbers) {
           //二分法 
           int n = numbers.length;
           int i = 0 , j = n -1;
           while(i < j)
           {
               int mid =  i + ((j-i) >> 1);
               if(numbers[mid] > numbers[j])
               {
                   i = mid + 1;
               }
               else if(numbers[mid] < numbers[j])
               {
                   j = mid;
               }
               else
               {
                   j--;
               }
           }
           return numbers[i];
    }