擅长:python、mysql、java
<p><a href="https://docs.python.org/3.7/library/heapq.html" rel="nofollow noreferrer">^{<cd1>} module</a>提供了<code>nlargest</code>和<code>nsmallest</code>函数来返回这样的序列段</p>
<pre class="lang-py prettyprint-override"><code>import heapq
players_score = [{'playerID': 'bondsba01', 'score': 771.0309445542441},
{'playerID': 'brookhu01', 'score': 334.40601958915977},
{'playerID': 'jamesbo01', 'score': 885.9822344322345},
{'playerID': 'hassero01', 'score': 593.022015503876},
{'playerID': 'addybo01', 'score': 785.2226861630111},
{'playerID': 'cedence01', 'score': 75.7351748570627},
{'playerID': 'eckerde01', 'score': 787.7921476129764},
{'playerID': 'wockejo01', 'score': 674.6701980001981}]
winners = heapq.nlargest(3,players_score, key=lambda x:x['score'])
print(*winners,sep="\n")
</code></pre>
<p>产生:</p>
<pre class="lang-py prettyprint-override"><code>{'playerID': 'jamesbo01', 'score': 885.9822344322345}
{'playerID': 'eckerde01', 'score': 787.7921476129764}
{'playerID': 'addybo01', 'score': 785.2226861630111}
</code></pre>