擅长:python、mysql、java
<p>这样可以解决您的问题:</p>
<pre><code>new_d = {}
for n in nums:
for r in ratios:
for k, v in d.items():
if r in k and n in k:
try:
old = new_d[(n, r)]
except:
old = 0
new_d[(n, r)] = v + old
for p, q in new_d.items():
print (p, q)
</code></pre>
<p>顺便说一句,在确定密钥是否可行时,您还忘了检查<code>n in k</code>。在</p>