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].
本题要求给定一个整型数组和某个固定的值,求出数组中能相加得到该固定值的两个整数,并返回这两个整数在数组中的索引。
(假设每个输入的固定值都恰是数组中某两个整数之和,且数组中的整数不能使用两次。)
Solution:
class Solution {
public:
vector<int> TwoSum(vector<int> &a, int t) {
vector<int> result;
map<int, int> m;
if (a.size() < 2)
return result;
for (int i = 0; i < a.size(); i++)
m[numbers[i]] = i;
map<int, int>::iterator it;
for (int i = 0; i < a.size(); i++) {
if ((it = m.find(t - numbers[i])) != m.end())
{
if (i == it->second) continue;
result.push_back(i+1);
result.push_back(it->second+1);
return result;
}
}
return result;
}
};