1. Two Sum

最新推荐文章于 2019-06-02 15:51:25 发布

crookie

最新推荐文章于 2019-06-02 15:51:25 发布

阅读量118

点赞数 1

分类专栏： leetcode

本文链接：https://blog.csdn.net/crookie/article/details/88414108

版权

leetcode 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        dic = {}
        for x,y in enumerate(nums):
            dic[y] = x
        for a in range(len(nums)):
            b = target - nums[a]
            if b in dic:
                if dic[b] != a:
                    return a,dic[b]

参考solution答案3：

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        dic = {}
        for x,y in enumerate(nums):
            dic[y] = x
        for a in range(len(nums)):
            b = target - nums[a]
            if b in dic:
                if dic[b] != a:
                    return a,dic[b]