版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/qq_32862515/article/details/84817398
简单的二分搜索。
int searchInsert(int* nums, int numsSize, int target) {
int l = 0, r = numsSize - 1;
while (l <= r)
{
int m = (l + r) / 2;
if (nums[m] == target)
return m;
else if (nums[m] > target)
r = m - 1;
else
l = m + 1;
}
return l;
}