leetcode-187. 重复的DNA序列
题目:
代码:
#include <iostream>
#include <vector>
#include <string>
#include <map>
using namespace std;
vector<string> findRepeatedDnaSequences(string s) {
vector<string> res;
if(s.size()<=10){
return res;
}
unordered_map<string,int> strmap;
string str1;
for(int i=0;i<= s.size()-10;i++){
str1=s.substr(i,10);
if(strmap.count(str1) == 1){
if(std::find(res.begin(),res.end(),str1)==res.end()){
res.push_back(str1);
}
}else{
strmap[str1]=1;
}
}
return res;
}
int main(){
vector<string> res;
string s;
cin>>s;
res = findRepeatedDnaSequences(s);
for(int i=0;i<res.size();i++){
cout<<res[i]<<" ";
}
return 0;
}