187. Repeated DNA Sequences Leetcode Python

关注

原创最新推荐文章于 2026-05-26 12:55:47 发布 1.6k 阅读 AI 写同款· GEO 优化 ›

LeetCode - 解题笔记 - 187 - Repeated DNA Sequences 因为题目限制了长度为10，涉及到四种位态，因此可以一个2位表示共20位的子串来保存当前状态，一个int整型数就能解决问题，能够优化扫描时间（滑窗）的同时也能节省存储（整型数的哈希）从初始位置不断向后寻找一个指定长度的子串，并用哈希表进行计数。满足要求时保存结果（注意避免重复判定的问题）。我想了几个能够简化子串存取的方法（滑窗），但是都不能实际优化复杂度。【官方题解参考】官方题解基于位操作给出了一个滑窗优化方案。由于题目的限制非常直观，因此解法也非常直观。Solution2的Python实现。... 阅读详情

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

this Problem can be solve with O(n) time and O(n) space with hashing

class Solution:
    # @param s, a string
    # @return a list of strings
    def findRepeatedDnaSequences(self, s):
        dict={}
        for i in range(len(s)-9):
            key=s[i:i+10]
            if key not in dict:
                dict[key]=1
            else:
                dict[key]+=1
        res=[]
        for elem in dict:
            if dict[elem]>1:
                res.append(elem)
        return res

收录于