杨辉三角的定义如下:
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
把每一行看做一个list,试写一个generator,不断输出下一行的list:
期待输出:
[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]
python代码:
# /usr/bin/python
# -*- coding:utf-8 -*-
def yangtri():
L = [1]
while True:
yield(L) #for循环执行过程中,遇到yield就中断,下次又从该位置继续执行
newL = [L[i]+L[i+1] for i in range(len(L)-1)] #列表生成器 上一章
L = newL
L.insert(0,1) #在第0位插入数据1
L.append(1)
n = 0
for t in yangtri(): #使用for循环来迭代才能获取generator的下一个值,或者使用.next()
print(t)
n = n + 1
if n==10:
break