python打印杨辉三角
# 方法一
def fab(max):
n, a, b =0, 0, 1
while n < max:
yield b #使用yield
a, b =b, a + b
n = n + 1
N = int (input("请输入生成行数N: "))
def yanghui_triangles():
a = [1]
while True:
yield a #执行到yield b 时，fab函数返回一个迭代值
a = [sum(i) for i in zip([0] + a,a +[0])]
i = 0
for t in yanghui_triangles():
print(t) #打印列表
i = i + 1
if i == N:
break
