Two sum

problem:

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]

 

project：

#include<iostream>
#include<vector>
#include<unordered_map>
using namespace std;

class Solution {
public:
	vector<int> twoSum(vector<int>& nums, int target) {
		unordered_map<int,int>m;
		vector<int>result;
		for (int i = 0; i<nums.size(); i++)
		{
			if (m.find(nums[i]) == m.end())
			{
				m[target - nums[i]] = i;
			}
			else
			{
				result.push_back(m[nums[i]] + 1);
				result.push_back(i + 1);
				break;
			}
		}
		return result;
	}
};

int main()
{
	vector<int>nums;
	nums.push_back(2);
        nums.push_back(7);
        nums.push_back(11);
        nums.push_back(15);
	int key = 9;
	Solution sum;
	vector<int>result;
	result=sum.twoSum(nums, key);
	for (int i = 0; i < result.size(); i++)
	{
		cout << result[i]<<" ";
	}
	system("pause");
	return 0;

}