题解 | #回文数字#

```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>p;
        int l=numbers.size();
        for(int i=0;i<l;i++)
        {
            auto j=p.find(target-numbers[i]);
            if(j!=p.end())
                return {j->second+1,i+1};
           else  p.insert(pair<int,int>(numbers[i],i));
        }
        return {};
    }
};