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
中文：
给定一个整形数组。如果数组里面有两个数相加等于目标数，返回他们的索引。
索引1必须比索引2小。
必须确保每个输入都有唯一解。
分析：没限制时间复杂度，可以用hash做。
另外，索引是从1开始的，所以要注意。

class Solution {
public:
vector<int> twoSum(vector<int> &num, int target) {
unordered_map<int, int> mapping;
vector<int> result;
for (int i = 0; i < num.size(); i++) {
mapping[num[i]] = i;
}
for (int i = 0; i < num.size(); i++) {
const int gap = target - num[i];
//leetcode题解有错误，两个索引不能相同。
if (mapping.find(gap) != mapping.end()&&mapping[gap]!=i) {
result.push_back(i + 1);
result.push_back(mapping[gap] + 1);
break;//必须有跳出循环。
}
}
return result;
}
};