# Leetcode161: Repeated DNA Sequences

163人阅读 评论(0)

All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes useful to identify repeated sequences within the DNA.

Write a function to find all the 10-letter-long sequences (substrings) that occur more than once in a DNA molecule.

For example,

Given s = "AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT",

Return:
["AAAAACCCCC", "CCCCCAAAAA"].

class Solution {
public:
int chartoint(char a)
{
if(a == 'A') return 0;
if(a == 'C') return 1;
if(a == 'G') return 2;
if(a == 'T') return 3;
}
vector<string> findRepeatedDnaSequences(string s) {
vector<string> res;
set<string> temp;
string str;
if(s.size()<10)
return res;
unsigned int val = 0;
for(int i = 0; i < 9; i++)
{
val <<= 2;
val |= chartoint(s[i]);
}
int map[1024*1024] = {0};
for(int i = 9; i < s.size(); i++)
{
val <<= 14;
val >>= 12;
val |= chartoint(s[i]);
map[val]++;
if(map[val] > 1)
{
str = s.substr(i-9, 10);
temp.insert(str);
}
}
for(set<string>::iterator i = temp.begin(); i != temp.end(); ++i)
{
res.push_back(*i);
}
return res;
}
};

0
0

个人资料
• 访问：84035次
• 积分：2490
• 等级：
• 排名：第17420名
• 原创：148篇
• 转载：119篇
• 译文：0篇
• 评论：6条
个人主页
文章分类
最新评论