187. Repeated DNA Sequences(建立词典,遍历一遍 o(n))
2024-09-27 07:35:19
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:
def findRepeatedDnaSequences(self, s):
"""
:type s: str
:rtype: List[str]
"""
d ={}
for i in range(len(s)-9):
if s[i:i+10] not in d:
d[s[i:i+10]]= 1
else:
d[s[i:i+10]]+= 1
res =[]
for i in d:
if d[i]>1:
res.append(i)
return res
最新文章
- word20161210
- bbs网站 models
- Spring的拦截器
- MySql的Delete、Truncate、Drop分析
- jQuery ui datepicker 日历转中文
- Java高效读取大文件
- listview 遇到问题java.lang.IndexOutOfBoundsException: Invalid index 0, size is 0
- java 读文件 解析
- 201521123071 《JAVA程序设计》第十周学习总结
- Android逆向工程
- js判断是微信、QQ内置浏览器打开页面
- mysql的csv数据导入与导出
- Python_部分内置函数
- 词频统计 List Array
- DHCP服务原理与搭建(Linux系统+路由器,二选一方案)
- 如何使用Python对Instagram进行数据分析?
- 《TCP/IP网络编程》
- DELL平板如何安装WIN10系统 -PE启动问题
- 如何使用 URLOpenStream 函数
- Android------------------的资源文件的学习