'''
给定一个整数数组 nums 和一个目标值 target,请你在该数组中找出和为目标值的那 两个 整数,并返回他们的数组下标。
你可以假设每种输入只会对应一个答案。但是,你不能重复利用这个数组中同样的元素。
示例:
给定 nums = [2, 7, 11, 15], target = 9
因为 nums[0] + nums[1] = 2 + 7 = 9
所以返回 [0, 1]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/two-sum
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
'''
class Solution:
def twoSum(self, nums:list, target: int)-> list:
for i in range(len(nums)-1):
for j in range(i+1, len(nums)):
if nums[i] + nums[j] == target:
return [i, j]
def twoSum2(self, nums:list, target: int)-> list:
s = set()#用来存储已经判断过的元素
for i in range(len(nums)-1):
if nums[i] not in s:
try: #在其后的列表区域查找满足条件的元素
j = nums[i+1:].index(target-nums[i])
except ValueError:
s.add(nums[i])
else:
return [i, i+1+j]
#网友提供
def twoSum3(self, nums:list, target: int)-> list:
hashmap = {}
for index, num in enumerate(nums):
another_num = target - num
#先把第一个元素放到字典,再到字典中查找是否存在与第二个元素配对的键
if another_num in hashmap:
return [hashmap[another_num], index]
hashmap[num] = index#注意相同键的值被更新
#改进版
def twoSum4(self, nums:list, target: int)-> list:
hashmap = {}
for index, num in enumerate(nums):
another_num = target - num
#先把第一个元素放到字典,再到字典中查找是否存在与第二个元素配对的键
if another_num in hashmap:
return [hashmap[another_num], index]
if num not in hashmap:
hashmap[num] = index
x = Solution()
a = [7,7,11,15]
t = 22
print(x.twoSum(a, t))
print(x.twoSum2(a, t))
print(x.twoSum3(a, t))
print(x.twoSum4(a, t))