首页 > 其他 > 详细

LeetCode | TwoSum

时间:2017-09-02 20:38:34      阅读:292      评论:0      收藏:0      [点我收藏+]

 

 

    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        dict = {}
        result = []
        for i in range(len(nums)):
            dict[nums[i]]= i
        print(dict) 
        for i in range(len(nums)):
            if (dict.get(target-nums[i]) != None) & (dict[target-nums[i]] != i ):
                    print(i)
                    result.append(i) 
                    result.append(dict.get(target-nums[i]))
                    break 
        return result

  

LeetCode | TwoSum

原文:http://www.cnblogs.com/gforc/p/7467543.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!