python杨辉三角形10行_python杨辉三角形两种方法

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]

n=0

while True:

yield L

d=L[:]

for t in range(len(L)-1):

L[t+1]=d[t]+d[t+1]

n=n+1

L.append(1)

if n==10:

break

for s in triangles():

print(s)

另一种方法如下：

def triangles():

L=[1]

n=0

while True:

yield L

L=[L[x]+L[x+1] for x in range(n)]

n=n+1

L.append(1)

L.insert(0,1)

if n==10:

break

for s in triangles():

print(s)

结果均为：

[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]