题目链接
思路分析
与LeetCode 1.两数之和的类型一样
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
unordered_map<int, int> hash;
for(int i = 0; i < nums.size(); i++){
int res = target - nums[i];
if(hash.count(res)) return {res, nums[i]};
else hash[nums[i]] = res;
}
return {};
}
};