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.

Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

1.方法一

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

2.方法二

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