# 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


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;
}
};

04-09 3.4万

02-22 2.2万

07-26 4227

09-17 1299

09-13 1213

08-10 1843

01-04 3373

12-31 7450

07-26 3753

12-19 1148