Python习题 廖雪峰 杨辉三角 生成器 实现代码

 原文链接

 

杨辉三角定义如下：

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

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

 

实现代码（在Python3下自测通过）

#!/usr/bin/python36
# -*- coding: utf-8 -*-


def triangles():
    base = 1       # 三角的基础指，一般都为1
    lTmp = [base]
    lTmp2 = [base]
    rowNum = 0    # 记录三角的行号

    while True:
        lTmp = lTmp2
        lTmp2 = [base]
        i     = 0

        while i < rowNum:
            # 向tmp2里插入tmp1里的数据
            if i == rowNum - 1:    #到行尾了，插入base值
                lTmp2.append(base)
            else:                  #没到行尾，则插入上一行相关的值
                lTmp2.append(lTmp[i] + lTmp[i+1])   

            i += 1

        yield lTmp2
        rowNum += 1

    return 'Done'


# 自测函数
# 期待输出:
# [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 test_triangles():
    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('测试失败!')    


test_triangles()        

 

自测结果：

# ./trip.py 
[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]
测试通过!