这是一条测试博客。
代码测试
int search(vector<int>& nums, int target) {
int left = 0;
int right = nums.size() - 1;
while (left <= right)
{
int middle = (right - left) / 2;
if (nums[middle] > target) {
right = middle - 1;
}
else if (nums[middle] < target)
{
left = middle + 1;
}
else {
return middle;
}
}
return -1;
}
图片测试