m = int(input('请输入行数:'))
def triangles():
L = [1]
while len(L) < = m:
yield L
L.append(0)
L = [L[i - 1] + L[i] for i in range(len(L))]
for t in triangles():
print(t)
输出杨辉三角的前m行,生成器的应用
最新推荐文章于 2023-03-28 11:23:43 发布