<qiyuangong>167_Two_Sum_II_Input_array_is_sorted_1.py
def twoSum( numbers, target):
    begin, end = 0, len(numbers) - 1
    while begin < end:
        curr = numbers[begin] + numbers[end]
        if curr == target:
            return [begin + 1, end + 1]
        elif curr < target:
            begin += 1
        else:
            end -= 1
def sample_funcname ( var_0 , var_1 ) :
    var_3 , var_6 = 0 , len ( var_0 ) - 1
    while var_3 < var_6 :
        var_7 = var_0 [ var_3 ] + var_0 [ var_6 ]
        if var_7 == var_1 :
            return [ var_3 + 1 , var_6 + 1 ]
        elif var_7 < var_1 :
            var_3 += 1
        else :
            var_6 -= 1
