题目:
给定一个整数数组 nums 和一个目标值 target,请你在该数组中找出和为目标值的那 两个 整数,并返回他们的数组下标。 你可以假设每种输入只会对应一个答案。但是,数组中同一个元素不能使用两遍。
示例:
给定 nums = [2, 7, 11, 15], target = 9
因为 nums[0] + nums[1] = 2 + 7 = 9
所以返回 [0, 1]
自己的做法:
def twoSum(nums, target):
index1 = 0
result = []
while index1 < len(nums):
if nums[index1] < target:
index2 = index1 + 1
while (index2 <= len(nums)):
if nums[index1] + nums[index2] == target:
result = [index1, index2]
break
index2 = index2 + 1
index1 = index1 + 1
return result
return result
较好的解法:
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
i = 0
dic = dict()
result = list()
while i < len(nums):
find = target - nums[i]
j = dic.get(find)
if j is not None:
result.append(j)
result.append(i)
break
else:
dic[nums[i]] = i
i += 1
return result