Discuss / Python / 如果用内置函数可以更加简洁

如果用内置函数可以更加简洁

Topic source
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])

吴宗秀111

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

sort是很巧妙啊,但是我觉得应该本着不改变源List的原则


  • 1

Reply