class Solution {
public:
int minArray(vector<int>& numbers) {
int ans, left = 0, right = numbers.size() - 1;
int mid;
while (left < right) {
mid = (left + right) / 2;
if (numbers[mid] < numbers[right])
right = (left + right) / 2;
else if (numbers[mid] > numbers[right])
left = (left + right) / 2 + 1;
else
right--;
}
return numbers[left];
}
};
剑指 Offer 11. 旋转数组的最小数字
最新推荐文章于 2024-09-11 19:54:50 发布