Problem Description
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].
Answer:
Language: cpp
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target)
{
unordered_map<int, int> d;
vector<int> ret;
for (size_t i = 0; i < nums.size(); ++i)
{
if (d.find(nums[i]) == d.end())
{
d[target-nums[i]] = i;
}
else
{
ret.push_back(d[nums[i]]);
ret.push_back(i);
break;
}
}
return ret;
}
};