【题目描述】
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].
【解题思路】
扫描两遍table,第一遍用哈希表记录每个元素位置(有重复也没关系),第二遍判断和当前元素的和为target的那个值是否在哈希表中并且不是当前元素,满足则得到答案
【代码】
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
int len=nums.size();
map<int,int> m;
vector<int> ans;
for(int i=0;i<len;i++){
m[nums[i]]=i;
}
for(int i=0;i<len;i++){
if(m.count(target-nums[i])>0&&m[target-nums[i]]!=i){
ans.push_back(i);
ans.push_back(m[target-nums[i]]);
break;
}
}
return ans;
}
};