int search(int* nums, int numsSize, int target)
{
int low=0,high=numsSize-1;
while(low<=high)
{
int mid=low+(high-low)/2;
if(nums[mid]>target)
{
high=mid-1;
}else if (nums[mid]<target)
{
low=mid+1;
}else
{
return mid;
}
}
return -1;
}
704. 二分查找
最新推荐文章于 2023-07-12 14:10:29 发布