zx = [8, 3, 12, 1, 2, 34, 54, 12, 34, 11, 12, 14, 9, 1, 10, 15, 17, 18, 99, 1, 3, 5, 10]
max_n = zx[0]
min_n = zx[1]
for i in zx:
if i > max_n: max_n = i
if i < min_n: min_n = i
avg_n = (max_n + min_n) / 2
print(max_n, min_n, avg_n)
closet_n = zx[0]
for n in zx:
if abs(avg_n - n) < abs(avg_n - closet_n):
closet_n = n
print("找到更近的了",closet_n)
运行结果如下: