Discuss / Python / 练习打卡
Back

练习打卡

Topic source

Superman灬code

#1 Created at ... [Delete] [Delete and Lock User]

简单版本：

def findMinAndMax(L):    if len(L) == 0:        return (None, None)    L.sort()    return (L[0], L[-1])

复杂版本：

def findMinAndMax(L):    if len(L) == 0:        return (None, None)    min = L[0]    max = L[0]    for i in L:        if min >= i:            min = i        if max <= i:            max = i    return (min, max)
  • 1

Reply