class Solution {
public:
/**
*
* @param numbers int整型vector
* @param target int整型
* @return int整型vector
*/
vector<int> twoSum(vector<int>& numbers, int target) {
unordered_map<int,int> umap;
for(int i=0;i<numbers.size();i++) umap[numbers[i]]=i;
vector<int> res;
for(int i=0;i<numbers.size();i++){
int rest=target-numbers[i];
if(umap.count(rest)!=0&&umap[rest]!=i){
res.push_back(i+1);
res.push_back(umap[rest]+1);
break;
}
}
sort(res.begin(),res.end());
return res;
}
};
NC61 两数之和(C++)- 简单、数组、哈希
最新推荐文章于 2024-05-23 20:19:57 发布