首页 > 代码库 > 01 A Counting DNA Nucleotides
01 A Counting DNA Nucleotides
Problem
A string is simply an ordered collection of symbols selected from some alphabet and formed into a word; the length of a string is the number of symbols that it contains.
An example of a length 21 DNA string (whose alphabet contains the symbols ‘A‘, ‘C‘, ‘G‘, and ‘T‘) is "ATGCTTCAGAAAGGTCTTACG."
Given: A DNA string ss of length at most 1000 nt.
Return: Four integers (separated by spaces) counting the respective number of times that the symbols ‘A‘, ‘C‘, ‘G‘, and ‘T‘ occur in ss.
Sample Dataset
AGCTTTTCATTCTGACTGCAACGGGCAATATGTCTCTGTGTGGATTAAAAAAAGAGTGTCTGATAGCAGC
Sample Output
20 12 17 21
方法一:
f = ‘AGCTTTTCATTCTGACTGCAACGGGCAATATGTCTCTGTGTGGATTAAAAAAAGAGTGTCTGATAGCAGC‘for i in f: b = list(f) # 把‘AAA’变成 [‘A‘,‘A‘‘,A‘] c = {} for i in b: c[i] = b.count(i) # 把key 和value 写入字典,如 A:1print (c.values()) # 最后的结果为 [20,12,21,17]
方法二:
f = ‘AGCTTTTCATTCTGACTGCAACGGGCAATATGTCTCTGTGTGGATTAAAAAAAGAGTGTCTGATAGCAGC‘counts = []for i in [‘A‘,‘C‘,‘G‘,‘T‘]: # 把输出的顺序定好 counts.append(f.count(i))print (‘\t‘.join(map(str, counts))) #map() 这里的意思是吧输出的[20,12,17,21]变为 20 12 17 21
01 A Counting DNA Nucleotides
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。