while (low <= high)
{
int middle = (low + high) / 2;
if (target == nums[middle])
{
return nums[middle];
}
else if (target > nums[middle])
{
low = middle + 1;
}
else if (target < nums[middle])
{
high = middle - 1;
}
}
- high的初始化(如果是vector):high=v.size()-1 就是说必须在vector的角标范围内
- 循环条件:low<=high
- 对low和high的修改:low=middle+1 high=middle-1
二分查找思路比较简单,但是有以上三个细节需要注意,不然极易出错。