1. Two Sum
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.
题意:
给定一个整形数组,返回两个数字的和等于特定目标数字的索引。
你可以假定每个输入都有一个解决方案。
思路:
首先,不能对该数组作任何预处理,因为要求返回是原始数组的下标,如果对数组进行了排序,那么下标就会乱(如果是有序数组,可以用双指针来做,参见Two Sum II - Input array is sorted)。这种无序数组可以用<value, index>的映射表。
遍历numbers,在映射表中寻找target-numbers[i],若找到则结束,返回存储的下标和当前下标,如果找不到则将<numbers[i], i>加入映射表。(这里又有一个问题,C++中常用的映射表有map, unordered_map,虽然二者差别不大,个人认为还是unordered_map效率高一些,因为其不会再根据键进行排序,详情可以去http://www.cplusplus.com/查看对比两个映射表的具体区别。)代码如下:
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> res;
unordered_map<int, int> hash;
for (int i = 0; i < nums.size(); i++)
{
if (hash.find(target-nums[i])==hash.end())
{
hash[nums[i]] = i;
}
else {
res.push_back(hash[target - nums[i]]);
res.push_back(i);
return res;
}
}
}
};