<doocs>0704.Binary Search_1.py
def search( nums: List[int], target: int) -> int:
    left, right = 0, len(nums) - 1
    while left < right:
        mid = (left + right) >> 1
        if nums[mid] >= target:
            right = mid
        else:
            left = mid + 1
    return left if nums[left] == target else -1
def sample_funcname ( var_0 : List [ int ] , var_3 : int ) -> int :
    var_5 , var_8 = 0 , len ( var_0 ) - 1
    while var_5 < var_8 :
        var_9 = ( var_5 + var_8 ) >> 1
        if var_0 [ var_9 ] >= var_3 :
            var_8 = var_9
        else :
            var_5 = var_9 + 1
    return var_5 if var_0 [ var_5 ] == var_3 else - 1
