class Solution {
public:
    vector<int> twoSum(vector<int>&N,int T){map<int,int>M;int i=0;
        for(;i<N.size()&&!M.count(T-N[i]);i++)M[N[i]]=i;
        return{M[T-N[i]]+1,i+1};
    }
};

比较简单的代码