二分搜索算法 2021-03-05

//写法<一>
#include <iostream>
using namespace std;
int nums[10]={1,3,3,3,4};
int binarySearch1(int nums[],int target){//搜索区间[left,right] 寻找一个数 
	int left=0;
	int right=4;//注意 
	while(left<=right){
		int mid=left+(right-left)/2;
		if(nums[mid]==target)return mid;
		else if(nums[mid]<target)left=mid+1;
		else if(nums[mid]>target)right=mid-1;
	}
	return -1;//注意
}
int binarySearch2(int nums[],int target){//搜索区间[left,right) 寻找左侧边界 
	int left=0;
	int right=5;//注意 
	while(left<right){
		int mid=left+(right-left)/2;
		if(nums[mid]==target)right=mid;
		else if(nums[mid]<target)left=mid+1;
		else if(nums[mid]>target)right=mid;
	}
	return left;//注意
}
int binarySearch3(int nums[],int target){//搜索区间[left,right) 寻找右侧边界 
	int left=0;
	int right=