Python：实现杨辉三角

impouo

已于 2023-06-27 14:48:02 修改

阅读量247

点赞数

文章标签： python 开发语言

于 2023-06-27 14:47:09 首次发布

本文链接：https://blog.csdn.net/weixin_44992183/article/details/131416852

版权

该代码定义了一个生成器函数`triangles`，用于不断生成杨辉三角的下一行列表。它从初始行[1]开始，通过迭代计算每行的新元素，将当前行相邻两个数相加得到下一行的中间项，最后在两端添加1。程序输出前10行的杨辉三角并进行测试，验证了函数的正确性。

摘要由CSDN通过智能技术生成

杨辉三角定义如下：

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

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

def triangles():
    row = [1]
    yield row
    
    while True:
               next_row = [1]  
               for i in range(len(row) - 1):
                   next_row.append(row[i] + row[i + 1])  
               next_row.append(1)  

               row = next_row 
               yield row

# 期待输出:
# [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():
    results.append(t)
    n = n + 1
    if n == 10:
        break

for t in results:
    print(t)

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('测试失败!')