two sum

class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
min_val = float(‘inf‘)
re_index = [0,0]
for i,m in enumerate(nums):
for j,n in enumerate(nums):
if i != j:
if (m + n) ==target:
re_index = [i,j]
return re_index
return ‘wrong target‘

map = {}
        for i in range(len(num)):
            if num[i] not in map:
                map[target - num[i]] = i + 1
            else:
                return map[num[i]], i + 1

two sum

原文：https://www.cnblogs.com/find1/p/10663483.html