Leetcode-1. Two Sum

1. 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.

Example:
Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> dst;
        for(int i=0;i<nums.size();++i)
            for(int j =i+1;j<nums.size();++j)
            {
                if(nums[i]+nums[j]==target)
                {
                    dst.push_back(i);
                    dst.push_back(j);
                }
            }
        return dst;
    }
};

Hash map

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
       unordered_map<int,int> A;
       vector<int> res;
       for(int i=0;i<nums.size();i++)
       {
           int sum = target - nums[i];
           if(A.find(sum) != A.end())
           {
               res.push_back(A[sum]);
               res.push_back(i);
               return res;
           }
           A[nums[i]]=i;
       }
        return res;
     }
};