leetcode-0001

发表于 | 阅读次数:
字数统计: 34 | 阅读时长 ≈ 1 
1
2
3
4
5
6
7
8
9

class Solution:
    # @return a tuple, (index1, index2)
    def twoSum(self, num, target):
        d = {}
        for i, n in enumerate(num):
            if target-n in d:
                return (d[target-n], i)
            d[n] = i