Two Sum

Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

 

思路：用映射表map存储原始数组vector。在加入一个元素前，检查target-number[i]是否在表里面，如果在，得到结果，如果不在，将元素number[i]添加进map中。

vector<int>  twoSum(vector<int> &numbers, int target){
	vector<int> result;
	map<int,int> m;
	int index1=-1,index2=-1;
	for(unsigned int i=0;i<numbers.size();i++){
		int temp=target-numbers[i];
		if(m.find(temp)!=m.end()){  //查找target-number[i]
			index1=m[temp];
			index2=i;
			break;
		}
		m[numbers[i]]=i;  //没找到就添加numbers[i]
	}
	  result.push_back(index1 + 1);
	  result.push_back(index2 + 1);
	  return result;
};