杨辉三角定义如下:
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(n):
L=[]
for i in range(n):
if len(L)<2:
L.append(1)
else:
length = len(L)
for i in range(length-1):
L[i]=L[i]+L[i+1]
L[length-1]=1
L.insert(0,1)
yield L
if __name__ == "__main__":
n1 = input('input times:')
n = int(n1)
for times in triangles(n):
print(list(times))
显示结果如下图所示: