杨辉三角 Python（利用嵌套列表）

更新版

list=[]
for i in range(0,10):
    list.append([])
    for k in range(0,i+1):
        list[i].append(1)
    if i>1:
        for j in range(0, i - 1):
            list[i][j+1] = list[i - 1][j] + list[i - 1][j+1]
for i in range(0,10):
    for k in range(0,i+1):
        print(list[i][k],end=" ")
    print()

运行结果：

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

旧版

code：

list=[[],[],[],[],[],[],[],[],[],[]]
j=1
for i in range(0,10):
    for k in range(0,i+1):
        list[i].append(1)
    if i>1:
        for j in range(0, i - 1):
            list[i][j+1] = list[i - 1][j] + list[i - 1][j+1]
    list[i][0] = 1
    list[i][-1] = 1
    i += 1
    print(list[i-1])

运行结果：

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