利用二维数组 输出10行杨辉三角

package com.lanou.java02;

public class YangHuiSanJiao2 {

publicstatic void main(String[] args) {

// 用二维数组  核心   i行j列等于  i-1行的 j和j-1列的值

int[ ][ ]a = newint [10][10];

for(inti = 0; i < a.length; i++){

for(int z = 0; z <=a.length - i; z++){

System.out.print(" ");

}

for(int j = 0 ; j <= i; j++){

if(j == 0 || i == 0 ||i == j ){

a[i][j] = 1;

}else{

a[i][j] =a[i - 1][j-1] +a[i - 1][j];

}

System.out.print(a[i][j] +" ");

}

System.out.println();

}

}

}