廖雪峰课后习题【生成器】【杨辉三角】

## -*- coding: utf-8 -*-
# 把每一行看做一个list，试写一个generator，不断输出下一行的list：
#   杨辉三角定义如下：
#
#        1
#       / \
#       1  1
#      / \ / \
#     1  2   1
#    / \/ \ / \
#   1   3  3   1
#  / \ / \/ \ / \
#  1  4  6   4   1
# / \/ \/ \ / \ / \
# 1  5  10 10  5   1


def triangles():
    L = [1]
    while True:
        yield L
        L = [1]+[L[i] + L[i+1] for i in range(len(L)-1)]+[1]

# 期待输出:
# [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]
n = 0
results = []
for t in triangles():
    print(t)
    results.append(t)
    n = n + 1
    if n == 10:
        break
if results == [
    [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]
]:
    print('测试通过!')
else:
    print('测试失败!')




```python

转载于:https://my.oschina.net/DBboy/blog/1789878