【LeetCode】1.TwoSum Python3解法

题目描述：

Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the same element twice.

例子：

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

思路：

从列表头开始遍历，分别找是否当前元素和列表中某一元素相加为target。注意排除自己加自己的情况。然后分别输出位置。

解法：

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        for i in range(len(nums)):
            if (target - nums[i]) in nums and nums.index(target - nums[i]) != i:
                return [i,nums.index(target - nums[i])]