二分查找 · 实现

def bsearch(____):
    lo, hi = ____, len(____) - ____
    while lo <= hi:
        mid = (____) // ____
        if nums[mid] == target:
            return mid
        if nums[mid] < target:
            lo = mid + ____
        else:
            hi = mid - ____
    return -____

def solve():
    return bsearch(____)