35. Search Insert Position - cocoder39/coco39_LC GitHub Wiki

int searchInsert(vector<int>& nums, int target) {
        //left most value that is greater than target
        //corner case: append to the end
        if (target > nums.back()) {
            return nums.size();
        }
        
        //insert
        int start = 0, end = nums.size() - 1;
        while (start + 1 < end) {
            int mid = start + (end - start) / 2;
            if (nums[mid] < target) {
                start = mid;
            } else{
                end = mid;
            }
        }
        
        if(nums[start] >= target){ //left most
            return start;
        }
        return end;
    }