递归去重的算法

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/ifubing/article/details/85016499
#coding:utf8

import random


# 递归
def getNoRepeatNum(havenum):
    num = random.randint(1,10)
    if num in havenum:
        num = getNoRepeatNum(havenum)
    return num


havenum = [1,8,7]
getnum = []
for i in range(6):
    num = getNoRepeatNum(havenum)
    havenum.append(num)
    getnum.append(num)

print getnum

猜你喜欢

转载自blog.csdn.net/ifubing/article/details/85016499