python杨辉三角金字塔(CQUPT.20201.4.26.1)
代码如下:
def fun(n):
list_1=[[1]*n for i in range(n)]#相当于创建二维数组
for i in range(n):
for j in range(i+1):
if(i==j or j==0):
list_1[i][j]=1
else:
list_1[i][j]=list_1[i-1][j]+list_1[i-1][j-1]
a=max(list_1[-1])
s=0
while(a>0):
s+=1
a//=10
for i in range(n):
if(i<n-1):
print(' '*s*(n-1-i),end='')
for j in range(i+1):
print("%*d"%(s,list_1[i][j]),end=' '*s)#print("{:^}")也可用于居中但是要知道明确的位数
print('\n')
n=int(input())
fun(n)