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

解法：
一次遍历，记录前面出现过的数值，当目标值减去当前值的数值有在map中的时候，返回

代码：

vector<int> twoSum(vector<int>& nums, int target) {
   	map<int, int> tmpMap = map<int, int>();
    vector<int> tars = vector<int>();
    for (int i = 0; i < nums.size(); ++i) {
        int nowValue = nums[i];
        int checkValue = target - nowValue;
        if (tmpMap.find(checkValue)!= tmpMap.end()) {
            return { tmpMap[checkValue], i };
        }else {
            tmpMap[nowValue] = i;
        }
    }
    return {};
}