整数二分
class Solution {
public int minArray(int[] numbers) {
int l = 0;
int r = numbers.length - 1;
while(r > 0 && numbers[r] == numbers[l]) r--;
if(numbers[r] >= numbers[l]) return numbers[l];
while(l < r){
int mid = (l + r) >> 1;
if(numbers[mid] < numbers[0]) r = mid;
else l = mid + 1;
}
return numbers[l];
}
}