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
用一个hashtable辅助,key为target减去第i个节点的值,value则为i。遍历数组的时候,如果hashtable中存在key为当前节点的值,那么则找到两个和为target的数了。
c++:
class Solution {
public:
vector<int> twoSum(vector<int> &numbers, int target) {
unordered_map<int,int> um;
vector<int> ret;
ret.clear();
if(numbers.size() == 0)
{
return ret;
}
int size = numbers.size();
int i;
int index1;
int index2;
for(i = 0;i < size;i ++)
{
if(um.find(numbers[i]) != um.end())
{
index1 = um[numbers[i]] + 1;
index2 = i + 1;
ret.push_back(index1);
ret.push_back(index2);
break;
}
else
{
um[target - numbers[i]] = i;
}
}
return ret;
}
};