Discuss / Python / 交作业，本来用sort排序了，但是想想这节就是迭代，又用回了迭代
Back

交作业，本来用sort排序了，但是想想这节就是迭代，又用回了迭代

Topic source

家有憨兔

#1 Created at ... [Delete] [Delete and Lock User] 
    if len(L) != 0:
        minNum = L[0]
        maxNum = L[0]
        for i in L:
            if i < minNum:
                minNum = i
            if i > maxNum:
                maxNum = i
            pass
        return minNum, maxNum
    else:
        return None, None

sy107@CHINA

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

def findMinAndMax(L=None):

    li=len(L)

    if li!=0:

        min=max=L[0]

        for s in L:

            if s> max:

                max = s

            elif s<min:

                min = s

        return (min, max)

    else:

        return (None, None)

# 测试

if findMinAndMax([]) != (None, None):

    print('测试失败!')

elif findMinAndMax([7]) != (7, 7):

    print('测试失败!')

elif findMinAndMax([7, 1]) != (1, 7):

    print('测试失败!')

elif findMinAndMax([7, 1, 3, 9, 5]) != (1, 9):

    print('测试失败!')

else:

    print('测试成功!')

  • 1

Reply