楊輝三角楊輝 定義如下:
1
/
1 1
/ /
1 2 1
/ / /
1 3 3 1
/ / / /
1 4 6 4 1
/ / / / /
1 5 10 10 5 1
把每一行看做一個list,試寫一個generator,不斷輸出下一行的list:
def triangles():
L = [1]
while True:
yield L
M=L[:]#複製一個list,這樣才不會影響到原有的list。不然results裡的每個列表的末尾會為0.
M.append(0)
L = [M[i-1]+M[i] for i in range(len(M))]
n =0
results = []
for t in triangles():
print(t)
results.append(t)
print(results)
n = n +1
if n == 10:
break