class Solution {
// 二分法,看大佬题解的说明
public int minArray(int[] numbers) {
int l=0,r=numbers.length-1;
while(l<r){
int mid=l+(r-l)/2;
if(numbers[mid]<numbers[r]){
r=mid;
}else if(numbers[mid]>numbers[r]){
l=mid+1;
}else if(numbers[mid]==numbers[r]){
r--;
}
}
return numbers[l];
}
}