给定升序有序数组nums = [1,3,3,5,7]，目标值target=3，下列代码中能够正确返回第一个大于等于target的元素下标（即1）的是？

第28589题单选题

本题考查二分查找的边界条件处理，用于查找有序数组的下界（第一个大于等于目标值的位置）。以下四个选项均为实现该功能的Python代码，请选择正确的一项。

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

def find_first_ge(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 find_first_ge(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 find_first_ge(nums, target):
    left, right = 0, len(nums)-1
    while left <= right:
        mid = left + (right - left) // 2
        if nums[mid] < target:
            left = mid + 1
        else:
            right = mid - 1
    return right

程序运行统计

暂无判题统计

知识点：

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

提交0次正确率0.00%

答案解析

New