Discuss / Python / 作业打卡
Back

作业打卡

Topic source

緣生意轉丶霜雪千年

#1 Created at ... [Delete] [Delete and Lock User] 
def findMinAndMax(L):
    minNum = L[0]
    maxNum = L[0]
    if len(L):
        for l in L:
            if l < minNum:
                minNum = l
            if l > maxNum:
                maxNum = l
    return (minNum, maxNum)

Vuean

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

如果L为空，是不是不能通过？

def findMinAndMax(L):    if L:        minL = L[0]        maxL = L[0]        for i in L:            if i < minL:                minL = i            if i > maxL:                maxL = i        return (minL, maxL)    else:        return (None, None)
  • 1

Reply