Python3-廖雪峰 学习笔记(三)——高级特性之生成器（generator）

练习

杨辉三角定义如下：

          1
         / \
        1   1
       / \ / \
      1   2   1
     / \ / \ / \
    1   3   3   1
   / \ / \ / \ / \
  1   4   6   4   1
 / \ / \ / \ / \ / \
1   5   10  10  5   1

把每一行看做一个list，试写一个generator，不断输出下一行的list：

# -*- coding: utf-8 -*-

def triangles():
    L = []
    outL = []
    outL.append(1)
    yield(outL)
    outL = [] #必须重新初始化，若是没有这一行，则会改变results中的[1]为[1,1],因为指向同一个地址，而append(1)会改变改地址中的内容
    outL.append(1)
    outL.append(1)
    yield(outL)
    L.append(1)
    L.append(1)
    for n in range(2,10):
        outL=[]
        outL.append(1)
        i=1
        while i< n:
            outL.append(L[i-1]+L[i])
            i=i+1
        outL.append(1)
        yield(outL)
        L=[]
        for n in outL:
            L.append(n)
            
# 期待输出:
# [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('\n',results)
    print('测试失败!')

本代码实现的函数过于神经病，有待优化