题解 | #两数之和#

#
# 
# @param numbers int整型一维数组 
# @param target int整型 
# @return int整型一维数组
#
class Solution:
    def twoSum(self , numbers , target ):
        # write code here
        for i in numbers:
            else_n = target - i
            if else_n in numbers[numbers.index(i)+1:len(numbers)]:
                index1 = numbers.index(i)
                index2 = numbers.index(else_n,index1+1,len(numbers))
                if index1 < index2 and index1!=index2:
                    return [index1+1,index2+1]
                else:
                    return [index2+1,index1+1]