擅长:python、mysql、java
<p>我不确定我是否正确理解了你的问题,但是你提到的<a href="https://stackoverflow.com/questions/16225677/get-the-second-largest-number-in-a-list-in-linear-time">post</a>已经给了你一些好的解决方案。例如,如果您不想自己编写算法,请使用标准库<a href="https://docs.python.org/2/library/heapq.html" rel="nofollow noreferrer">heapq</a>,如下所示:</p>
<pre><code>import random
import heapq
random.seed(1)
el = [random.randint(1, 100) for i in range(20)]
print el
first_max, second_max = heapq.nlargest(2, el)
print "Max element is {0} and the second max {1}".format(first_max,
second_max)
</code></pre>