Python学习笔记二：杨辉三角(列表生成器和生成器)

转载自：https://blog.csdn.net/sinat_28296297/article/details/77340618

题目 
杨辉三角定义如下： 
1 
1 1 
1 2 1 
1 3 3 1 
1 4 6 4 1 
1 5 10 10 5 1 
把每一行看作一个list,试写一个 generator,不断输出下一行的list。 
期待输出： 
[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] 

def triangles():
        N=[1]
    while True:
       yield N
       N.append(0)
       N= [N[x-1]+N[x] for x in range(len(N))]
n = 0
results = []
for t in triangles():
    print(t)
    results.append(t)
    n = n + 1
    if n == 10:
        break