Search Insert Position_1.cpp

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