题解 | #两数之和#

#include <set>
#include <unordered_map>
#include <vector>
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param numbers int整型vector 
     * @param target int整型 
     * @return int整型vector
     */
    vector<int> twoSum(vector<int>& numbers, int target) {
        // write code here
        unordered_map<int, int> m;
        vector<int> res;
        for(int i=0;i<numbers.size();i++){
            if(m.find(target-numbers[i])!=m.end()){
                res.push_back(m[target - numbers[i]]+1);
                res.push_back(i+1);
            }else{
                m[numbers[i]]=i;
            }
        }
        return res;
    }
};