class Solution {
public:
vector<int> twoSum(vector<int> &numbers, int target) {
vector<int>res;
map<int,int>mp;
for(int i=0;i<numbers.size();i++)
{
int a=target-numbers[i];
if(mp.find(a)==mp.end())
mp[numbers[i]]=i+1;
else{
res.push_back(mp[a]);
res.push_back(i+1);
break;
}
}
return res;
}
};
题目 LeetCode: two-sum 暴力破解
https://leetcode-cn.com/problems/two-sum/
two-sum Given an array of integers, returnindicesof the t...
https://leetcode-cn.com/problems/two-sum/
给定一个数组和一个整型，请在找到数组中的两个下标，使得对应下标的和等于给定的整型值。小的下标在前，较大下标在后 如...
题目 给一个数组和一个和，查找出数组中两个数相加为给定的和 Given an array of integers,...
https://leetcode.com/problems/two-sum/description/ Given ...
Two Sum It is not easy to write Two-Sum right for the fir...
https://leetcode.com/problems/two-sum/ Given an array of ...
本文标题：two-sum
本文链接：https://www.haomeiwen.com/subject/gkeaectx.html
网友评论