python杨辉三角

在控制台输出如图所示一个8层的杨辉三角。

杨辉三角介绍：

每个数等于它上方两数之和

每行数字左右对称，由1开始逐渐变大

第n行的数字有n项，将n取8

 

n = 8
a = [1]
b = [1, 1]
c = []
print(a)
print(b)
for i in range(1, n):
    c.clear()
    c.append(1)
    for j in range(i):
        c.append(b[j]+b[j+1])
    c.append(1)
    b = c.copy()
    print(c)

运行结果：

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