leetcode 35. Search Insert Position

题意

给一个有序数组，找插入位置

题解

找大于等于target的第一个数，使用自定义lower_bound的函数来查找插入位置

代码

class Solution {public:    int my_lower_bound(vector<int>& nums, int target)    {        int left = 0, right = nums.size() - 1;        while(left < right)        {            int mid = (left + right) / 2;            if(nums[mid] < target)                left = mid + 1;            else                right = mid;        }        return left;    }    int searchInsert(vector<int>& nums, int target) {        int pos = my_lower_bound(nums, target);        return nums[pos] >= target ? pos : nums.size();    }};