题解 | #hash表——两数之和#

#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
        vector<int> res;
        unordered_map<int,int> hash;
        for(int i=0;i<numbers.size();i++){
            int temp = target - numbers[i];
            if(hash.find(temp) == hash.end()) hash[numbers[i]] = i;
            else{
                res.push_back(hash[temp] + 1);
                res.push_back(i+1);
                break;
            }
        }
        return res;
    }
};