Discuss / Python / 没有考虑效率等问题~

没有考虑效率等问题~

Topic source

def findMinAndMax(L):

if len(L) == 0:

return(None,None)

min = L[0]

max = L[-1]

for i in L:

if i < min:

min = i

if i > max:

max = i

return (min, max)

print(findMinAndMax([]))


  • 1

Reply