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