杨辉三角python generator实现

#生成器
# g=(x*x for x in range(10))
# for x in g:
#     print(x)
# #斐波拉契数列
# def fib(max):
#     n,a,b=0,0,1
#     while n<max:
#         yield b#yield关键字把函数变成generator
#         a,b=b,a+b
#         n=n+1
#     return 'done'
# f=fib(5)
# for x in f:
#     print(x)
#杨辉三角
def triangles(n):
  L=[1]
  while True:
      yield L
      L=[L[x]+L[x+1] for x in range(len(L)-1)]
      L.insert(0,1)
      L.append(1)
      if len(L)>10:
          berak
a=triangles(5)
for a in a:
    print(a)

杨辉三角的python实现方法`L=[L[x]+L[x+1] for x in range(len(L-1))
L.insert(0,1)
L.append(1)