算法描述
输入:定长长度n,变长序列
输出:定长序列
pseudo code:
if(m>n):
for i in range(n):
s[i]=p[i]
else:
d=n-m
cplt=0
for i in range(m):
c1=random.uniform(0,1)
if(c1>0.5):
c2=random.randint(1,d-s)
else:
c2=1
cplt=cplt+c2
for j in range(c2):
s.append(p[i])
if(d-cplt>0):
for i in range(d-cplt):
s.append(s[m])