leetcode187. Repeated DNA Sequences

题意：

187. Repeated DNA Sequences

Medium

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.

Example:

Input: s = "AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT"

Output: ["AAAAACCCCC", "CCCCCAAAAA"]

思路：

代码：

Java

class Solution {
    public List<String> findRepeatedDnaSequences(String s) {
        Set<String> sub_string=new HashSet<>();
        Set<String> res_string=new HashSet<>();
        for(int i=0;i+9<s.length();++i){
            String sub=s.substring(i,i+10);
            if(!sub_string.add(sub)){//添加失败，说明已经存在，说明不止重复一次
                res_string.add(sub);
            }
        }
        return new ArrayList(res_string);//set->list
    }
}

Python

class Solution:
    def findRepeatedDnaSequences(self, s: str) -> List[str]:
        seq=collections.defaultdict(int)#defaultdict：字典的子类，提供了一个工厂函数，为字典查询提供了默认值
        for i in range(len(s)):
            seq[s[i:i+10]]+=1
        return [key for key,value in seq.items() if value>1]