class Solution {
public:
int search(vector<int>& nums, int target) {
int left = 0, right = nums.size();
int middle;
while(left < right) {
middle = left + (right - left) / 2;
if(nums[middle] > target) {
right = middle;
} else if (nums[middle] < target) {
left = middle + 1;
} else {
return middle;
}
}
return -1;
}
};
力扣704. 二分查找
最新推荐文章于 2025-11-24 01:23:29 发布
286

被折叠的 条评论
为什么被折叠?



