有序数组中插入位置

[1,3,5,6]

[1,3,5,6]

[1,3,5,6]

[1,3,5,6]

int searchInsert(vector<int>& nums, int target)
{
int start = 0;
int last = nums.size();
while (start < last)
{
int mid = (start + last) / 2;
if (nums[mid] >= target)
{
last = mid;
}
else
{
start = mid + 1;
}
}
return start;
}