【Python】用generator实现杨辉三角

最新推荐文章于 2024-06-23 11:59:34 发布

FancyVin

最新推荐文章于 2024-06-23 11:59:34 发布

阅读量2.3k

点赞数

分类专栏： Python

本文链接：https://blog.csdn.net/FancyVin/article/details/56479437

版权

Python 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

本文为廖雪峰Python3教程的学习笔记。

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

def triangles():
    L=[1]
    while True:
        yield(L)
        L.append(0)
        L = [L[n - 1] + L[n] for n in range(len(L))]
# 期待输出:
# [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
for t in triangles():
    print(t)
    n = n + 1
    if n == 10:
        break