擅长:python、mysql、java
<p>我会选择:</p>
<pre><code>import heapq
res = heapq.nlargest(2, some_sequence)
print res[1] # to get 2nd largest
</code></pre>
<p>这比排序整个列表,然后获取第一个<code>n</code>多个元素更有效。有关详细信息,请参见<a href="http://docs.python.org/2/library/heapq.html" rel="noreferrer">heapq documentation</a>。</p>