python找出第二大的数_如何在列表中找到第二大数字？

您不必对输入进行排序，而且此解决方案在O(n)中运行。既然你的问题是你不能使用内置函数，你可以使用这个alist=[-45,0,3,10,90,5,-2,4,18,45,100,1,-266,706]

largest, larger = alist[0], alist[0]

for num in alist:

if num > largest:

largest, larger = num, largest

elif num > larger:

larger = num

print larger

输出100

跟踪最大数和第二大数(larger变量存储在代码中)。如果当前数大于largest，则当前数变为largest，largest变为larger。

largest, larger = num, largest是temp = largest

largest = num

larger = temp

根据评论中OP的要求编辑：def findLarge(myList):

largest, larger = myList[0], myList[0]

for num in myList:

if num > largest:

largest, larger = num, largest

elif num > larger:

larger = num

return largest, larger

alist=[-45,0,3,10,90,5,-2,4,18,45,100,1,-266,706]

firstLargest, firstLarger = findLarge(alist[:len(alist)//2])

secondLargest, secondLarger = findLarge(alist[len(alist)//2:])

print sorted((firstLarger, firstLargest, secondLarger, secondLargest))[-2]