今天练习第一道:二分查找
#include <iostream>
#include<vector>
using namespace std;
class Soluiation
{
public:
int search(vector<int>& nums, int target) {
int left = 0;
int right = nums.size() - 1;
while (left <= right) { //使用左闭右闭区间,当left=right时,区间[left right]任然有效。
int middle = (left + right) / 2;
if (nums[middle] > target) { // 说明在左区间
right = middle - 1;
}
else if(nums[middle] < target) { // 说明在右区间
left = middle + 1;
}
else
{
return middle;
}
}
// 未找到目标值
return -1;
}
};
int main()
{
Soluiation a;
vector<int> nums;
int n = 0;
cout << "请输入n:" << endl;
cin >> n;
cout << "请输入nums:" << endl;
int tem = 0;
for (int i = 0; i < n; i++) {
cin >> tem;
nums.push_back(tem);
}
int target = 0;
cout << "请输入target:" << endl;
cin >> target;
cout << a.search(nums, target) << endl;
return 0;
}