剑指11 Java

旋转数组的最小数字,
（转载） 二分法

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