class Solution {

 public:

     vector<int> twoSum(vector<int>& nums, int target) {

         vector<int>result;

         int i,j,k;

         map<int,int>h;

         for(i=;i<nums.size();i++) {

             if(!h.count(nums[i]))

             h[nums[i]]=i+;

             k=h[target-nums[i]];

             if(k>&&k!=i+) {

                 result.push_back(k-);

                 result.push_back(i);

                 break;

             }

         }

         return result;

     }

 };