class Solution {
public:
int minArray(vector<int>& numbers) {
int l = 0, r = numbers.size() - 1;
while (l < r) {
int mid = (r - l) / 2 + l;
if (numbers[mid] > numbers[r])
l = mid + 1;
else if (numbers[mid] < numbers[r])
r = mid;
else
r--; //暂认为因为有和r下标相同的值,删除r不会影响最后结果
}
return numbers[l];
}
};
09-11
327