class Solution {
public:
vector<string> findRepeatedDnaSequences(string s) {
int l = 10;
vector<string> res;
unordered_map<string, int> m;
int n = s.size();
for(int i = 0; i <= n - l; ++i){
string str = s.substr(i, l);
if(++m[str] == 2){ //记录出现次数等于2的字符串,防止重复记录
res.push_back(str);
}
}
return res;
}
};
LeetCode 187. 重复的DNA序列
最新推荐文章于 2024-10-06 14:10:45 发布