如何用递归的方式实现去重和去零

weixin_66368093

已于 2022-07-13 10:28:39 修改

阅读量156

点赞数 1

文章标签： python

于 2022-07-13 10:27:42 首次发布

本文链接：https://blog.csdn.net/weixin_66368093/article/details/125758583

版权

def distinct(numbers, numlen, n):
    if n >= numlen:
        return 0
    value = numbers[n]

    found = False
    if value != '0' and value != 0:
        for i in range(n):
            #是否和之前的相同
            if value == numbers[i]:
                found = True
                break
    else:
        found = True

    n += 1
    m = distinct(numbers, numlen, n)
    if found:
        return m
    else:
        return m + 1


if __name__ == '__main__':
    arr=[
        [1,0,0,1],
        [0,1,0,1],
        [1,0,0,1],
        [1,1,0,1],
        [0,1,1,1],
        [1,2,'0',2],
        ['0',2,1,2],
        [1,2,3,3],
        [1,'0',3,2],
        [1,0,3,2,3]
    ]

    errcount = 0;
    for i in range (1):
        count = distinct(arr[i], 4, 0)
        if count != arr[i][4]:
            errcount = errcount + 1
            print("the result is not excepted: return=", count, " exception=", arr[i][4], ",i=", i)

    if errcount == 0:
        print("OK")