[数据结构与算法]搜索插入位置

public int searchInsert(int[] nums, int target) {
    return left_bound(nums, target);
}

int right_bound(int[] nums, int target) {
    int left = 0, right = nums.length - 1;
    while (left <= right) {
        int mid = left + (right - left) / 2;
        if (nums[mid] <= target) {//锁定右侧边界，收缩左侧边界
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }
    // 最后要检查 right 越界的情况
    if (right < 0 || nums[right] != target) return -1;
    return right;
}