返回列表中最大的和第二大的元素,不允许使用Python内置的排序和最大函数。
冒泡排序
def item(ls):
n = 0
while n < len(ls):
for i in range(len(ls) - 1):
if ls[i] > ls[i + 1]:
ls[i], ls[i + 1] = ls[i + 1], ls[i]
n += 1
return ls[-1], ls[-2]
print(item([321, 5345, 3466, 31, 213, 3223, 3, 423]))
def find_max_two(items:list):
first,second = (items[0],items[1]) if items[0]>=item[1]\
else (items[1],items[0])
for _ in range(2,len(items)):
if items[_]>first:
second = first
first = items[_]
elif items[_]>second:
second = items[_]
return first,second