LeetCode 1. Two Sum（C++版）

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

思路分析：

从下标为0到n-2遍历数组。对于每一个nums[i]，判断nums[i+1]到nums[n-1]有没有和nums[i]的和恰好为target的，有则找到结果，返回。

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

方法二：

使用map。遍历数组，若（target－数组的值）不在map中，将（numbers[ i ], i）作为(key, value)存入map中。若在map中，返回其对应的索引和当前数组的索引。

class Solution {
public:  
    vector<int> twoSum(vector<int> &numbers, int target) {
        vector<int> ret(2,-1);
        unordered_map<int, int> m;    //value->index map
        for(int i = 0; i < numbers.size(); i ++)
        {
            if(m.find(target-numbers[i]) == m.end()) //target-numbers[i] not appeared
               // m[numbers[i]] = i;//不在就插入到map中
                m.insert(map<int, int>::value_type(numbers[i], i));
            else
            {
                ret[0] = m[target-numbers[i]]; 
                ret[1] = i;
                return ret;
            }
        }
    }
};