题解 | #两数之和#

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        unordered_map<int,int>p;
        for(int i=0;i<numbers.size();i++)
        if(p.count(target-numbers[i]))return vector<int>{p[target-numbers[i]]+1,i+1};
        else p[numbers[i]]=i;
        return vector<int>{};
    }
};