int search(int* nums, int numsSize, int target)
{
int left = 0;
int right = numsSize - 1;
while(left <= right)
{
int mid = (left + right) / 2;
if(target > nums[mid])
{
left = mid + 1;
}
else if(target < nums[mid])
{
right = mid -1;
}
else if(target == nums[mid])
{
return mid;
}
}
return -1;
}
力扣-704.二分查找
最新推荐文章于 2024-07-25 23:20:14 发布