原题目:https://leetcode-cn.com/problems/repeated-dna-sequences/
思路:
遍历字符串,用hash存储,最后看一下谁出现了多次
代码:
class Solution {
public:
vector<string> findRepeatedDnaSequences(string s) {
int n = s.size();
if(n<10) return {};
unordered_map<string,int> m;
vector<string> ans;
for(int i=0;i<=n-10;i++){
m[s.substr(i,10)]++;
}
for(auto q:m){
if(q.second > 1) ans.push_back(q.first);
}
return ans;
}
};