Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
You can return the answer in any order.
Example 1:
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2:
Input: nums = [3,2,4], target = 6
Output: [1,2]
Example 3:
Input: nums = [3,3], target = 6
Output: [0,1]
Constraints:
2 <= nums.length <= 103
-109 <= nums[i] <= 109
-109 <= target <= 109
Only one valid answer exists.
这道题是哈希映射里面经典的一道题,我们通过理解题意发现使用值-下标作为键值对还是比较好的
代码:
#include <unordered_map>
class Solution {
public:
unordered_map<int,int> hashmap;
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> ans;
int len = nums.size();
int x,y;
for(int i=0; i<len; i++){
x = target-nums[i];
// cout<<"x="<<x<<endl;
if(hashmap.count(x) > 0 ){
y = hashmap[x];
// cout<<"y="<<y<<endl;
ans.push_back(i);
ans.push_back(y);
break;
}else{
hashmap.insert(make_pair(nums[i],i));
}
}
return ans;
}
};