利用生成器来生成杨辉三角
看到一个很棒的代码
def triangles(n):
L = [1]
while len(L) < n+1:
yield list(L)
L.append(0)
L = [L[i - 1] + L[i] for i in range(len(L))]
n = 10
results = []
for t in triangles(n):
print(t)
results.append(t)
if results == [
[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('测试失败!')