187. Repeated DNA Sequences 【M】【30】

关注

原创最新推荐文章于 2026-10-23 14:26:51 发布 594 阅读 AI 写同款· GEO 优化 ›

ROS智能车定位导航仿真+功能包自带的地图实现+自己建立的地图实现 ROS智能车定位导航仿真一、前言二、效果图三、准备工作[1.在Ubuntu上安装ROS Kinetic](https://blog.csdn.net/qq_42585108/article/details/104327661)2.创建ROS工作区间①1创建racecar_ws和src文件夹②初始化工作空间③下载racecar源代码包，并编译工程四、启动仿真1.设置环境变量2.启动地图五、建图1.启动slam和rviz2 控制车辆（左侧有个控制窗口），WASD控制前左后右的运动就可以建图了：3.新建终端保存地阅读详情

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

从头到尾顺序扫描的hash

class Solution(object):
    def findRepeatedDnaSequences(self, s):
        
        dic = {}
        
        for i in xrange(len(s) - 9):
            t = s[i:i+10]
            
            dic[t] = dic.get(t,0) + 1
        
        #l = sorted(dic.iteritems(),key = lambda d:d[1],reverse = True)
        res = []
        
        for k,v in dic.items():
            #print k,v
            if v > 1:
                res += k,
                
        #print res
        return res
        
        """
        :type s: str
        :rtype: List[str]
        """

收录于