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