版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/sun11462/article/details/47805241
杨慧三角java实现
public class YH {
public static void main(String[] args) {
int a[][]=new int [10][10];
int i,j,n=10;
for(i = 0;i < n ;i++)
{
for(int k=0;k<n-i;k++){
System.out.print(" ");
}
for(j = 0;j < i;j++)
{
if(i == j || j == 0) a[i][j] = 1;
else
a[i][j] = a[i-1][j] + a[i-1][j-1];
System.out.print(a[i][j]+" ");
}
System.out.print('\n');
}
}
}