Two Sum

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

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