def triangles():
l = [1]
while True:
yield l
l = [1] + [l[k] + l[k+1] for k in range(len(l)-1)] + [1]
n = 0
results = [] # 这行可以不要
for t in triangles():
print(t)
results.append(t) # 这行可以不要
n = n + 1
if n == 10:
break
杨辉三角实现
最新推荐文章于 2022-03-24 14:11:37 发布