力扣刷题一：两数之和（python3）

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        for i in range(len(nums)):
            for k in range(len(nums)-i-1):
                j = i+k+1
                if nums[i]+nums[j]==target:
                    return i,j

后面看到其他博主的方法有用到enumerate函数，单循环，只用了728ms,15.5mb：

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        for index,i in enumerate(nums):
            if target - i in nums:
                if index == nums.index(target-i):
                    continue
                else: 
                    return index,nums.index(target-i)

最后又想到了字典映射，用列表中数据作为key,数据的索引作为值,用时32ms,占16.1mb：

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        tmp={}
        for i in range(len(nums)):
            another = target - nums[i]
            if tmp.get(another) is not None:
               return [tmp.get(another),i]
            tmp[nums[i]]=i