标签:.com int ash ted val range ret hash sum
https://leetcode.com/articles/two-sum/#approach-2-two-pass-hash-table-accepted
class Solution(object): def twoSum(self, nums, target): """ :type nums: List[int] :type target: int :rtype: List[int] """ seen = {} # use dictionary data structure for i in range(len(nums)): # i is the position/key of the num num2 = target - nums[i] # num2 is the value if num2 in seen: # num2 is the key return [seen[num2], i] else: seen[nums[i]] = i return ‘Not found‘
标签:.com int ash ted val range ret hash sum
原文地址:http://www.cnblogs.com/prmlab/p/6888767.html