给定一个整数数组 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
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
# 解法一:list直接index寻址,运行时间880ms,空间占用12.5MB
class Solution(object):
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
if len(nums) < 2:
return list()
first = 0
second = 0
for i, val in enumerate(nums):
val_diff = target - val
if val_diff in nums:
j = nums.index(val_diff)
if j != i:
first = i
second = j
break
return [i, j]
# 解法二:字典映射,运行时间36ms,空间占用13.1MB
class Solution(object):
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
if len(nums) < 2:
return list()
map_dict = {}
for i, val in enumerate(nums):
val_diff = target - val
if val_diff in map_dict:
j = map_dict[val_diff]
break
map_dict[val] = i
return [i, j]