def findMinAndMax(L): if len(L) <= 0: return (None, None) for i in range(len(L)-1): for j in range(len(L)-1-i): if L[j] > L[j+1]: L[j], L[j+1] = L[j+1], L[j] return L[0], L[-1]
Sign in to make a reply
爱吃小笼包的-小笼包