two sum 发表于 2018-04-11 | 分类于 algorithm , leetcode | 阅读次数 | 1234567891011121314151617181920212223242526272829"""https://leetcode-cn.com/problems/two-sum/description/"""class Solution(object): def twoSum(self, nums, target): """ :type nums: List[int] :type target: int :rtype: List[int] >>> s = Solution() >>> nums = [3, 2, 4] >>> target = 6 >>> s.twoSum(nums, target) [1, 2] """ # tmp = [target - i for i in nums] # for idx, i in enumerate(tmp): # try: # idx2 = nums.index(i) # if idx2 != idx: # return [idx, idx2] # except ValueError: # pass dic = {} for idx, num in enumerate(nums): if target - num in dic: return [dic[target-num], idx] dic[num] = idx Donate WeChat Pay Alipay