例题1:LC 1.两数之和
题目链接:https://leetcode-cn.com/problems/two-sum/
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int, int> hashtable;
for (int i = 0; i < nums.size(); ++i) {
auto it = hashtable.find(target - nums[i]);
if (it != hashtable.end()) {
return {it->second, i};
}
hashtable[nums[i]] = i;
}
return {};
}
};
哈希表都使用unordered_map
拓展2:map 迭代器iterator的first,second到底是什么?
it是一个地址,it->first是下标,it->second是下标所对映的值