see-1. Two Sum

177 阅读 0 评论 117 点赞

我是靠谱客的博主妩媚香菇，这篇文章主要介绍see-1. Two Sum，现在分享给大家，希望可以做个参考。

python版：

class Solution:
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
ans = list()
for i,item in enumerate(nums):
if (target-item) in nums and (i!=nums.index(target-item)):
ans.append(i)
ans.append(nums.index(target-item))
break
return ans

C++版：

class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int, int> mp;
int len = nums.size();
vector<int> res(2);
for (int i = 0; i < len; ++i) {
if (mp.find(target - nums[i]) != mp.end()) {
res[0] = mp[target - nums[i]];
res[1] = i;
break;
}
else {
mp[nums[i]] = i;
}
}
mp.clear();
return res;
}
};