【Python笔记】编码一个generator实现杨辉三角

杨辉三角定义：

          1
        1   1
      1   2   1
    1   3   3   1
  1   4   6   4   1
1   5   10  10  5   1

主要特点：每个数字等于上一行的左右两个数字之和，即第n+1行的第i个数等于第n行的第i-1个数和第i个数之和，可用此性质写出整个杨辉三角。

实现代码：

def triangles():
    yield [1]
    n = 2
    i = 1
    l1 = [1,1]
    l2 = [1,1]
    while True:
        i = 1
        while i < n - 1:
            l2.insert(i, l1[i-1] + l1[i])
            i = i + 1
        yield l2
        l1 = l2
        l2 = [1,1]
        n = n + 1


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]