def findMinAndMax(L): if len(L) == 0: return (None,None) max = L[0] min = L[0] for i in L: if i > max: max = i if i < min: min = i return (min, max)
发现python有自带的sorted(),min(),max()函数能极大简化代码，希望以后再写的时候能考虑到多用python自带的函数。
Sign in to make a reply
伞内的星空
-- coding: utf-8 --
def findMinAndMax(L): if len(L) == 0: return (None,None) max = L[0] min = L[0] for i in L: if i > max: max = i if i < min: min = i return (min, max)