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

151 阅读 0 评论 100 点赞

我是靠谱客的博主朴实日记本，这篇文章主要介绍如何用递归的方式实现去重和去零，现在分享给大家，希望可以做个参考。

复制代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
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")