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

思路：使用hashmap，数组元素的数值作为Key，数组元素的下标作为value，再用goal=target-num[i]得到需要查找的那个数，如果找到此

goal，返回hash[goal]和i（i为数组的下标）。

class Solution
{
public:
    vector<int> twoSum(vector<int>& nums, int target) 
    {
        /*int s=nums.size();
        vector<int> v;
        char f=0;
        for(int i=0;i<s-1;i++)
        {
            for(int j=i+1;j<s;j++)
            {
                if(nums[i]+nums[j]==target)
                {
                    v.push_back(i);
                    v.push_back(j);
                    f=1;
                    break;
                }
            }
            if(f) break;
        }
        return v;*/
        
        //Key is the number and value is its index in the vector.
        unordered_map<int, int> hash;
        vector<int> result;
        for (int i = 0; i < nums.size(); i++)
        {
            int numberToFind = target - nums[i];

                //if numberToFind is found in map, return them
            if (hash.find(numberToFind) != hash.end())
            {
                result.push_back(hash[numberToFind]);
                result.push_back(i);			
                return result;
            }
                //number was not found. Put it in the map.
            hash[nums[i]] = i;
        }
	    return result;
    }
};