def findMinAndMax(L):
if len(L) == 0:
return (None, None)
m, n = L[0], L[0]
for v in L:
if v < n:
n = v
elif v > m:
m = v
return (n, m)
def findMinAndMax(L):
return (min(L), max(L)) if len(L) > 0 else (None, None)
def findMinAndMax(L):
if len(L) == 0:
return (None, None)
L.sort()
return (L[0], L[-1])
倔强的leter