Discuss / Python / day6 打卡
Back

day6 打卡

Topic source

这么黑再胖可不就成了我

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

啊，终于又完成了一题~~~

def findMinAndMax(L):
    if len(L)==0:
        return (None, None)
    else:
        L_max=L[0]        
        for i in L:
            if L_max<i:
                L_max=i
            else:
                pass
        L_min=L[0]
        for i in L:
            if L_min>i:
                L_min=i
            else:
                pass
        return (L_min,L_max)

培培要人陪

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

    if len(L)==0:

        return (None,None)

    elif len(L)==1:

        return (L[0],L[0]) 

    else:

        for i in L:

            L_min=min(L)

            L_max=max(L)

            return (L_min,L_max)

  • 1

Reply