题目链接:https://www.acwing.com/problem/content/description/71/
题目如下:
class Solution {
public:
vector<int> findNumbersWithSum(vector<int>& nums, int target) {
unordered_map<int,int> umap;
for(int i=0;i<nums.size();i++){
umap[nums[i]]=i;
}
for(int i=0;i<nums.size();i++){
int rest=target-nums[i];
if(umap.count(rest)!=0&&umap[rest]!=i){
return {rest,nums[i]};//看清题目要求输出的是什么
}
}
return {-1,-1};
}
};