思路与算法
int searchInsert(int* nums, int numsSize, int target){
int left = 0, right = numsSize - 1, ans = numsSize;
while(left <= right)
{
int mid = ((right - left)>>1) + left;
if(target <= nums[mid])
{
ans = mid;
right = mid - 1;
}
else
{
left = mid + 1;
}
}
return ans;
}