# Two Sum

152人阅读 评论(0)

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

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：53861次
• 积分：3090
• 等级：
• 排名：第11240名
• 原创：255篇
• 转载：1篇
• 译文：0篇
• 评论：1条
阅读排行
最新评论