leetcode 1.两数之和

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        unordered_map<int,int> mpt;
        for(int i=0;i<nums.size();i++){
            mpt[nums[i]]=i;
        }
        vector<int> res(2,0);
        for(int i=0;i<nums.size();i++){
            auto ans=mpt.find(target-nums[i]);
            if(ans!=mpt.end()&&ans->second!=i){
                res[0]=i;
                res[1]=ans->second;
                break;
            }
            
        }
        return res;
    }
};