杨辉三角

这是一个很有启发的小习题：

print('练习:杨辉三角')
def triangles ():
    L = [1]
    while True:
        yield L
        L =[1] + [value + L[i + 1] for i, value in enumerate(L) if i < len(L)-1] + [1] #L=[1]+[*,*,*]+[1]
m=triangles()
print(next(m))
print(next(m))
print(next(m))
print('以下为检查结果：')
result=[]
n=0
for t in triangles():
print (t)
result.append(t)
n+=1
if n==10:
break
if result==[
[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('测试失败!')