题解 | #两数之和#

#
# 
# @param numbers int整型一维数组 
# @param target int整型 
# @return int整型一维数组
#
class Solution:
    def twoSum(self , numbers , target ):
        # write code here
        for i in range(len(numbers)):
            temp=target-numbers[i]
            if temp in numbers :
                j=numbers.index(temp)
                if i!=j:
                    res=[min(i+1,j+1),max(i+1,j+1)]
                    break
                else:
                    continue
            else:
                continue
        return res