1、Two Sum

Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

 Array Hash Table

解题：使用map存储遍历过的值。

对于unordered_map与哈希表之间的关系，以及哈希表的内部原理还不甚了解。

 vector<int> twoSum(vector<int> &numbers, int target) {
        unordered_map<int, int> mp;//键值：值——位置
        vector<int> result;
        int length = numbers.size();
        int remain;
        for (int i = 0; i < length; ++i)
        {
            remain = target - numbers[i];
            unordered_map<int, int>::iterator iter = mp.find(remain);
            if (iter == mp.end())
                mp.insert(make_pair(numbers[i], i));
            else
            {
                result.push_back(iter->second + 1);
                result.push_back(i + 1);
                break;
            }
        }
        return result;
    }