<qiyuangong>001_Two_Sum_4.py
def twoSum( nums, target):
    nums_index = [(v, index) for index, v in enumerate(nums)]
    nums_index.sort()
    begin, end = 0, len(nums) - 1
    while begin < end:
        curr = nums_index[begin][0] + nums_index[end][0]
        if curr == target:
            return [nums_index[begin][1], nums_index[end][1]]
        elif curr < target:
            begin += 1
        else:
            end -= 1
def sample_funcname ( var_0 , var_1 ) :
    var_5 = [ ( var_2 , var_3 ) for var_3 , var_2 in enumerate ( var_0 ) ]
    var_5.sort ( )
    var_8 , var_11 = 0 , len ( var_0 ) - 1
    while var_8 < var_11 :
        var_12 = var_5 [ var_8 ] [ 0 ] + var_5 [ var_11 ] [ 0 ]
        if var_12 == var_1 :
            return [ var_5 [ var_8 ] [ 1 ] , var_5 [ var_11 ] [ 1 ] ]
        elif var_12 < var_1 :
            var_8 += 1
        else :
            var_11 -= 1
