JAVA---输出杨辉三角

package lll;

public class Test {
	public static void main(String[] args) {
		//声明一个二维数组
		int[][] yangHui=new int[10][];
		for(int i=0;i<yangHui.length;i++){
			//给每一行初始化
			yangHui[i]=new int[i+1];
			//给第一列元素赋值
			yangHui[i][0]=1;
			//给最后一列元素赋值
			yangHui[i][yangHui[i].length-1]=1;
			//按照杨辉三角的规律给其他元素赋值
			for(int j=1;j<yangHui[i].length-1;j++){
				yangHui[i][j]=yangHui[i-1][j-1]+yangHui[i-1][j];
			}
		}
		//遍历打印二维数组
		for(int i=0;i<yangHui.length;i++){
			for(int j=0;j<yangHui[i].length;j++){
				System.out.print(yangHui[i][j]+"  ");
			}
			System.out.println();
		}
	}
}