题解 | 二分查找-I
二分查找-I
https://www.nowcoder.com/practice/d3df40bd23594118b57554129cadf47b
int search(int *nums,int numsLen,int target)
{
int left=0,right=numsLen-1;
for(int i=0;i<numsLen;i++)
{
int mid=left+(right-left)/2;
if(nums[mid]<target)
{
left=mid+1;
}
if(nums[mid]>target)
{
right=mid-1;
}
if(nums[mid]==target)
{
return mid;
break;
}
}
return -1;
}
