针对升序整数数组实现查找第一个大于等于target的元素下标，以下哪个代码可以正确完成需求？

第28578题单选题

以下代码均使用Python语言实现，输入的nums为严格升序的整数数组，若所有元素都小于target则返回数组长度n：

def lower_bound(nums, target):
    left, right = 0, len(nums)-1
    while left <= right:
        mid = left + (right - left) // 2
        if nums[mid] >= target:
            right = mid
        else:
            left = mid + 1
    return left

def lower_bound(nums, target):
    left, right = 0, len(nums)
    while left < right:
        mid = left + (right - left) // 2
        if nums[mid] >= target:
            right = mid -1
        else:
            left = mid +1
    return left

def lower_bound(nums, target):
    left, right = 0, len(nums)-1
    while left < right:
        mid = left + (right - left) // 2
        if nums[mid] >= target:
            right = mid
        else:
            left = mid +1
    return left if nums[left] >= target else -1

def lower_bound(nums, target):
    left, right = 0, len(nums)
    mid = left + (right - left) // 2
    while left <= right:
        if nums[mid] >= target:
            right = mid -1
        else:
            left = mid +1
    return left

程序运行统计

暂无判题统计

知识点：

算法实现-二分边界条件处理

提交0次正确率0.00%

答案解析

New