#include<stdio.h>
#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
int search(vector<int>& nums, int target) {
int left = 0;
int right = nums.size() - 1; // 定义target在左闭右闭的区间里,[left, right]
while (left <= right) { // 当left==right,区间[left, right]依然有效,所以用 <=
int middle = left + ((right - left) / 2);// 防止溢出 等同于(left + right)/2
if (nums[middle] > target) {
right = middle - 1; // target 在左区间,所以[left, middle - 1]
}
else if (nums[middle] < target) {
left = middle + 1; // target 在右区间,所以[middle + 1, right]
}
else { // nums[middle] == target
return middle; // 数组中找到目标值,直接返回下标
}
}
// 未找到目标值
return -1;
}
};
int main() {
vector<int> nums;
nums.push_back(-1);
nums.push_back(0);
nums.push_back(3);
nums.push_back(5);
nums.push_back(9);
nums.push_back(12);
for (int i = 0; i < nums.size(); i++)
{
cout << nums[i] << " ";
}
int target = 9;
class Solution s1;
s1.search(nums, target);
cout << "目标值的下标为:" << s1.search(nums, target) << endl;
}
ACM 二分查找
最新推荐文章于 2022-07-09 18:05:13 发布