1. 两数之和 - 力扣(LeetCode)https://leetcode.cn/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 {};
}
};