<doocs>0167.Two Sum II - Input Array Is Sorted_1.py
def twoSum( numbers: List[int], target: int) -> List[int]:
    i, j = 1, len(numbers)
    while i < j:
        x = numbers[i - 1] + numbers[j - 1]
        if x == target:
            return [i, j]
        if x < target:
            i += 1
        else:
            j -= 1
    return [-1, -1]
def sample_funcname ( var_0 : List [ int ] , var_3 : int ) -> List [ int ] :
    var_5 , var_7 = 1 , len ( var_0 )
    while var_5 < var_7 :
        var_8 = var_0 [ var_5 - 1 ] + var_0 [ var_7 - 1 ]
        if var_8 == var_3 :
            return [ var_5 , var_7 ]
        if var_8 < var_3 :
            var_5 += 1
        else :
            var_7 -= 1
    return [ - 1 , - 1 ]
