力扣二分查找
把target不断与中间的数比较,比中间数大的话就去右边找,小的话就去左边找,相等则返回下标
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
return mid;
}
return -1;
}