python中杨辉三角形_python写杨辉三角形

标签：

学了generator，写一个杨辉三角形的作业，想了很久想不到，看到评论有一个非常巧妙算法，膜拜一下

详情参考：http://www.liaoxuefeng.com/wiki/0014316089557264a6b348958f449949df42a6d3a2e542c000/0014317799226173f45ce40636141b6abc8424e12b5fb27000#0

def triangles():

N = [1]

while True:

yield N

N.append(0)

N = [N[i-1] + N[i] for i in range(len(N))]

n = 0

for t in triangles():

print(t)

n=n+1

if n == 10:

break

输出结果如下：

[1]

[1, 1]

[1, 2, 1]

[1, 3, 3, 1]

[1, 4, 6, 4, 1]

[1, 5, 10, 10, 5, 1]

[1, 6, 15, 20, 15, 6, 1]

[1, 7, 21, 35, 35, 21, 7, 1]

[1, 8, 28, 56, 70, 56, 28, 8, 1]

[1, 9, 36, 84, 126, 126, 84, 36, 9, 1]

标签：