leetcode--Two Sum--无序关联容器--hash map

1. Two Sum

My Submissions

Question Editorial Solution

Total Accepted: 212598  Total Submissions: 943550  Difficulty: Easy

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.

Example:

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

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

UPDATE (2016/2/13):
The return format had been changed to zero-based indices. Please read the above updated description carefully.

Subscribe to see which companies asked this question

Show Tags

Show Similar Problems

Have you met this question in a real interview? 

Yes

 

No

Discuss

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

class Solution
{
public:
	vector<int> twoSum(vector<int>& nums, int target) {

		//sort(nums,nums.begin(),nums.end());
		int aa = 0;
		int bb = 0;
		int indexaa = 0;
		vector<int> ans;
		unordered_map<int, int> numsIndex;

		for (auto iterTemp1 = nums.begin(); iterTemp1 != nums.end(); ++iterTemp1)
		{
			aa = (*iterTemp1);
			bb = target - aa;

			if (numsIndex.find(bb) != numsIndex.end())
			{
				ans.push_back((*(numsIndex.find(bb))).second);
				ans.push_back(indexaa);
				
				//cout << (*(numsIndex.find(bb))).second<< indexaa  << endl;
				return ans;
			}
			
			numsIndex[aa] = indexaa;

			indexaa++;
		}
	}


};