擅长:python、mysql、java
<p>它可以做得更简单(是关于DNA上的基因编码吗?):</p>
<pre><code>evenList = ['GAAGCTCG', 'AAATTT', 'CTCTAGGAC']
oddList = ['CCTCGGGA', 'GGGCCC', 'GAGTACCTG']
def matchList(evenList, oddList):
totalIndexSeq = []
match_list = [('A','T'), ('T','A') ,('G','C'), ('C','G')]
pairedList=zip(evenList.upper(),oddList.upper()) # tuples from evenList and oddList elements
for p in pairedList:
pairs=zip(list(p[0]),list(p[1])) # tuples of even and odd list characters
indexSeq=[ str(i) if p in match_list else '+' for i,p in enumerate(pairs)]
totalIndexSeq.append(''.join(indexSeq)) #convert to string and add to list
return totalIndexSeq
</code></pre>
<p>您对列表的长度没有任何限制(实际上您在代码中也没有使用<code>integ</code>)。现在你得告诉我你想递归哪一部分?
我通常建议不要递归,因为资源使用率很高</p>