Discuss / Python / 迭代打卡

迭代打卡

Topic source

初白n

#1 Created at ... [Delete] [Delete and Lock User]
lst=[1,2,3,4,5,6,7,8,9]def find_max_min(lst): #定义找出最大最小值的函数    if not lst:        return None    else:        max_val = max(lst)        min_val = min(lst)        return (max_val, min_val)print(find_max_min(lst))

  • 1

Reply