class Solution:
def twoSum(self, nums: List[int], target: int)->List[int]:
n=len(nums)
for x in range(n):
i=nums[x]
j=target-i
for y in range(x+1,n):
if j==nums[y]:
return [x,y]
break
else:
continue
hashmap算法用字典方式