1. Two Sum

最新推荐文章于 2019-08-30 17:39:16 发布

6plus

最新推荐文章于 2019-08-30 17:39:16 发布

阅读量215

点赞数

分类专栏： Leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/gcola007/article/details/58636467

版权

Leetcode 专栏收录该内容

90 篇文章 0 订阅

订阅专栏

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

vector<int> twoSum(vector<int> &numbers, int target)
{
    //Key is the number and value is its index in the vector.
	unordered_map<int, int> hash;
	vector<int> result;
	for (int i = 0; i < numbers.size(); i++) {
		int numberToFind = target - numbers[i];

            //if numberToFind is found in map, return them
		if (hash.find(numberToFind) != hash.end()) {
                    //+1 because indices are NOT zero based
			result.push_back(hash[numberToFind] + 1);
			result.push_back(i + 1);			
			return result;
		}

            //number was not found. Put it in the map.
		hash[numbers[i]] = i;
	}
	return result;
}

这个题目用的是哈希散列表快速查找,数据结构上似乎有讲过然而忘了.老版是hash_map,新版是unordered_map.

结果返回的是原表nums中元素的序号,新建的vector的索引(index,复数形式是indices)是从-1开始的,而push_back的意思是在末尾

添加一个元素,因此hash[numbertofind]的意思应该是序号？还是不太理解

-------------------------------------------------------------------------------------------

二刷leetcode，本题主要涉及数据结构哈希表,O(n)算法如上

附上python解法：

class Solution:
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        if len(nums)<=1:
            return False
        buff_dict={}
        for i in range(len(nums)):
            if nums[i] in buff_dict:
                return [buff_dict[nums[i]],i]
            else:
                buff_dict[target-nums[i]]=i