def triangles(m):
if m == 1:
print([1])
else:
print([1])
print([1,1])
S1 = [1,1]
while (m - 1) > 1:
L = [1,1]
i = len(S1)
n = 0
while n < i-1:
L.insert(n+1, S1[n]+S1[n+1])
n = n + 1
print(L)
S1 = L
m = m - 1
return "done"
#以上是定义的杨辉三角函数
#以上是定义的杨辉发生器
def T():
yield([1])
yield([1,1])
S1 = [1,1]
while True:
L = [1,1]
i = len(S1)
n = 0
while n < i-1:
L.insert(n+1, S1[n]+S1[n+1])
n = n + 1
yield(L)
S1 = L
return "done"
n = 0
for t in T():
print(t)
n = n + 1
if n == 10:
break
零零散散zyl
快写了一天了······