187. Repeated DNA Sequences

最新推荐文章于 2024-08-17 16:52:22 发布

SnailRunFast

最新推荐文章于 2024-08-17 16:52:22 发布

阅读量137

点赞数

CC 4.0 BY-SA版权

分类专栏： Leet Code

本文链接：https://blog.youkuaiyun.com/snailrunfast/article/details/86516351

Leet Code 专栏收录该内容

143 篇文章

订阅专栏

本文介绍了一种算法，用于从DNA分子中找出所有长度为10的重复子序列。通过使用HashSet进行存储和查找，该算法能有效识别出DNA中重复出现的特定序列。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

187. Repeated DNA Sequences

Medium

358142FavoriteShare

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"]

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