用 unordered_map 查询是否出现要找到元素
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int, int>unmap;
for (int i = 0; i < nums.size(); i++) {
unmap.insert(pair<int, int>(nums[i], i));
auto it = unmap.find(target - nums[i]);
//1.若 !=unmap.end(),说明 unmap中有与 nums[i]匹配的 target - nums[i]
//2.it->second != i防止 nums[i]恰好等于 target/2
// 导致返回两个相同的下标,如 nums{ 3 , 3 },target=6
if (it != unmap.end() && it->second != i) {
return{ it->second,i };
}
}
return{};
}
};
把 unmap.insert(pair<int, int>(nums[i], i)); 加到最后就不用再判断 it->second != i
因为在循环遍历到 x 时 nums[x] 还未加入unmap
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int, int>unmap;
for (int i = 0; i < nums.size(); i++) {
auto it = unmap.find(target - nums[i]);
if (it != unmap.end()) {
return{ it->second,i };
}
unmap.insert(pair<int, int>(nums[i], i));
}
return{};
}
};
参考:https://www.programmercarl.com/0001.%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.html#%E6%80%9D%E8%B7%AF
初学者,见解不足,如有错误请指出