[LeetCode] 1. Two Sum

两数之和算法解析

最新推荐文章于 2020-10-21 10:33:51 发布

转载最新推荐文章于 2020-10-21 10:33:51 发布 · 43 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/skyssky/p/5740405.html

本文介绍了一种解决“两数之和”问题的有效算法。该算法通过使用哈希表来存储数组元素及其对应的索引，实现了在一次遍历中找到目标和的两个数。这种方法不仅简化了问题的复杂度，还提高了查找效率。

__author__ = 'zenglinwang'

class Solution(object):

    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """

        map = dict()

        # Since two numbers are mutually complemented, one pass hash table can do.
        for i in range(0, len(nums)):
            complement = target - nums[i]
            # print "- [{0:d},{1:d}]".format(nums[i], i)
            # print map.items()
            if complement in map.keys() and map.get(complement) != i:
                # print "[{0:d},{1:d}]".format(map.get(complement), i)
                return [map.get(complement), i]
            map[nums[i]] = i

# s = Solution()
# s.twoSum([0,4,3,4,5,4], 8)