目录
题目叙述
解题代码
int searchInsert(int* nums, int numsSize, int target){
int left = 0;
int right = numsSize - 1;
int mid;
while(left <= right)
{
mid = left + (right - left)/2;
if(target < nums[mid])
{
right = mid - 1;
}
else if(target > nums[mid])
{
left = mid + 1;
}
else
{
return mid;
}
}
return left;
}