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 <= 104
-109 <= nums[i] <= 109
-109 <= target <= 109
Only one valid answer exists.来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/two-sum
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
题目大意:
返回两数之和等于target的索引。
实现思路:
双for大法就不写了,写写哈希表的方法。
实现代码:
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<int> ans;
map<int,int> mp;
for(int i=0;i<nums.size();i++){
if(!mp.count(target-nums[i])){
mp.insert(pair<int,int>(nums[i],i));
}
else{
auto it=mp.find(target-nums[i]);
ans.push_back(i);
ans.push_back(it->second);
break;
}
}
return ans;
}
};
通过这道题,对哈希表进行了复习。
这里注意几点:
1、map.find()返回的是所要找的键的迭代器。
2、还有map.insert的用法要记住。map.insert(pair<type,type>(……,……))。
3、还有知道迭代器可以知道通过it->first访问键,通过it->second访问值。