python实现杨辉三角

n=int(input())
a=[[0 for i in range(n)] for j in range(n)]
for i in range(n):
    a[i][i]=1
    a[i][0]=1
    for j in range(0,i):
        a[i][j]=a[i-1][j-1]+a[i-1][j]
for i in range(n):
    for j in range(0,i+1):
          print(a[i][j],end=' ')
    print()

假定n=4,该代码段生成了一个4*4的全0的二维数组。

n=int(input())
a=[[0 for i in range(n)] for j in range(n)]

[[0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]]