Leetcode 剑指 Offer II 068. 查找插入位置（DAY 176）---- 二分查找学习期

• • 原题题目
  • 代码实现（首刷自解）

class Solution {
public:

    int my_lower_bound(vector& nums,int target)
    {
        int left = 0,right = nums.size();
        while(left < right)
        {
            int mid = (left + right)/2;
            if(nums[mid] < target) left = mid + 1;
            else right = mid;
        }
        return left;
    }

    int searchInsert(vector& nums, int target) {
        return my_lower_bound(nums,target);
    }
};