题解 | #两数之和#

    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 t=target-numbers[i];
            //若是没找到 将信息存到哈希表中
            if(hash.find(t)==hash.end()){
                hash[numbers[i]]=i;
            }else{
                //注意下标加一
                res.push_back(hash[t]+1);
                res.push_back(i+1);
                break;
            }
        }
        return res;
    }