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"].
Subscribe to see which companies asked this question
My sOLUTION:
import java.util.*;
public class Solution {
public List<String> findRepeatedDnaSequences(String s) {
List<String> re=new ArrayList<String>();
Set<String> data=new HashSet<String>();
if(s.length()<=10)
return re;
for(int i=0;i+10<=s.length();++i){
String temp=s.substring(i,i+10);
if(data.contains(temp)&&!re.contains(temp)){
re.add(temp);
continue;
}
else{
data.add(temp);
continue;
}
}
return re;
}
}