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.

vector<int> twoSums(vector<int>& nums, int target)
{
   map<int, int> map1;
   vector<int> vec;
   for(int i = 0; i < nums.size(); i++)
   {
       if(map1.find(target - nums[i]) == map1.end())
       {
          map1[nums[i]] = i;
       }
       else
       {
         vec.push_back(map1[target - nums[i]] );
         vec.push_back(i);
         break;
       }
   }
   return vec;
}