def second_max(): if lt[0]>lt[1]: yida = lt[0] erda = lt[1] else: yida = lt[0] erda = lt[1] n = len(lt) i = 2 while i < n: if lt[i]>yida: erda = yida yida = lt[i] elif lt[i]>erda: erda = lt[i] i += 1 return erda lt = [12,33,4,56,23,76,76] print(second_max())
#返回一个列表中第二大的数,记录第一大和第二大
最新推荐文章于 2024-04-14 11:26:42 发布