<1>——Two Sum-CSDN博客

本文链接：https://blog.csdn.net/qq_21916897/article/details/77388751

1、Two Sum

两数之和

给一个整数数组，找到两个数使得他们的和等于一个给定的数 target。

你需要实现的函数twoSum需要返回这两个数的下标, 并且第一个下标小于第二个下标。注意这里下标的范围是 1 到 n，不是以 0 开头。

注意事项

你可以假设只有一组答案。

样例

给出 numbers = [2, 7, 11, 15], target = 9, 返回 [1, 2].

我的代码：

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
       int N = nums.size();
	vector<int> a;
	for(int i = 0; i<N; i++)
	{
		for (int j = i+1; j < N; j++)
			if (nums[i] + nums[j] == target)
			{
				a.push_back(i);
				a.push_back(j);
				return a;
			}
	}
    }
};

经典代码：

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;
}