public int minArray(int[] numbers) {
int max = Integer.MIN_VALUE;
int n = numbers.length;
int i = 0;
for (; i < n; i++) {
if (numbers[i] >= max) {
max = numbers[i];
}
else return numbers[i];
}
return numbers[0];
}
class Solution {
public int minArray(int[] numbers) {
int n = numbers.length;
int i = n - 1;
while (i > 0 && numbers[i - 1] <= numbers[i]) i --;
if (i == 0) return numbers[0];
else return numbers[i];
}
}