一:
/*
关于二分查找:
1.查找目标值:
当right=nums.size()-1时,判定条件应该为left<=right right赋值时也应该是mid-1;
当right=nums.size()时,判定条件应该为left<right right赋值时也应该是mid;
*/
/*2. 查找第一个不小于(>=)目标值的数*/
int search(vector<int>& nums, int target)
{
int pos;
int left = 0;
int right = nums.size() ;
while (left < right)
{
int mid = left + (right-left) / 2;
if (nums[mid] < target)
left = mid + 1;
else right = mid;
}
return right;
}
/*可变形为查找最后一个小于(<)目标值的数:上述代码最后返回right-1;*/
/*3. 查找第一个大于(>)目标值的数*/
int search(vector<int>& nums, int target)
{
int left = 0;
int right = nums.size() - 1;
while (left < right)
{
int mid = left + (right-left) / 2;
if (nums[mid] <= target)
left = mid + 1;
else right = mid;
}
return right;
}
/*
返回最后一个相同的数字的下一个位置。
if (nums[mid] <= target) 判定条件多了一个等号
最后返回为right-1;
可变形为查找最后一个不大于(<=)目标值的数:最后返回为right-1;
*/
#include<iostream>
using namespace std;
int BinFindValue(int* arr, int left, int right,int key)//递归二分查找
{
int pos = -1;
if (left>right)
{
return pos;
}
int mid = (right - left + 1) / 2 + left;
if (arr[mid] == key)
{
pos = mid;
}
if (arr[mid] < key )
{
return BinFindValue(arr,mid+1,right,key);
}
if (arr[mid] > key)
{
return BinFindValue(arr, left, mid - 1,key);
}
}
int BinFindValueNice(int* arr,int len,int key)//非递归二分查找
{
int pos = -1;
if (arr == NULL || len <= 0)
{
return pos;
}
int left = 0;
int right = len - 1;
while (left<=right)
{
int mid = (right-left+1) / 2 + left;
if (key < arr[mid])
{
right = mid - 1;
}
else if (key > arr[mid])
{
left = mid + 1;
}
else
{
while (mid > left && key == arr[mid - 1]) --mid;
pos = mid;
break;
}
}
return pos;
}
int main()
{
int arr[] = {3,5,7,9,16,15,46,55};
int len = sizeof(arr) / sizeof(arr[0]);
cout << BinFindValueNice(arr,len,5) << endl;
cout << BinFindValue(arr,0,len-1,55) << endl;
return 0;
}