方法一:
int binarySearch(vector<int>& nums,int target)
{
int left=0,right=nums.size()-1;
while(left<=right)
{
int mid=left+(right -left)>>1;
if(nums[mid]==target)
return mid;
else if(nums[mid]<target)
left=mid+1;
else
right=mid-1;
}
return -1;
}
直接比较mid与target
起始条件:left=0,right=nums.size()-1
循环条件:left<=right
向左缩小:left=mid-1
向右缩小:right=mid+1
循环结束时:left==right+1
方法二:
int binarySearch(vector<int>& nums,int target)
{
int left=0,right=nums.size();
while(left<right)
{
int mid=left+(right -left)>>1;
if(nums[mid]==target)
return mid;
else if(nums[mid]<target)
left=mid+1;
else
right=mid;
}
if(left!=nums.size()&&nums[left]==target)
return left;
return -1;
}
比较mid+1位置上的元素与target
起始条件:left=0,right=nums.size()
循环条件:left<right
向左缩小:left=mid-1
向右缩小:right=mid
循环结束时:left==right
方法三
int binarySearch(vector<int>& nums,int target)
{
int left=0,right=nums.size()-1;
while(left+1<right)
{
int mid=left+(right -left)>>1;
if(nums[mid]==target)
return mid;
else if(nums[mid]<target)
left=mid;
else
right=mid;
}
if(nums[left]==target)
return left;
if(nums[right]==target)
return right;
return -1;
}
比较mid-1,mid+1位置上的元素与target
起始条件:left=0,right=nums.size()-1
循环条件:left<right
向左缩小:left=mid
向右缩小:right=mid
循环结束时:left+1==right