187. Repeated DNA Sequences

最新推荐文章于 2024-10-19 16:37:08 发布

zsjmfy

最新推荐文章于 2024-10-19 16:37:08 发布

阅读量140

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/zsjmfy/article/details/54909238

版权

leetcode 专栏收录该内容

149 篇文章 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”].

一刷ac
解题思路：遍历字符串，按长度10截取字符串，判断截取的子串是否截取过，分别将遍历的结果和重复的串放在两个set中，返回结果。

public class Solution {
    public List<String> findRepeatedDnaSequences(String s) {
        Set seen = new HashSet(), repeated = new HashSet();
        for (int i = 0; i + 9 < s.length(); i++) {
            String ten = s.substring(i, i + 10);
            if (seen.contains(ten)){
                repeated.add(ten);
            }else seen.add(ten);
        }
        return new ArrayList(repeated);
    }
}