Exercício do Triângulo Yang Hui
package com.xin.Array;
public class YangH
{
public void text3(){
//创建杨辉三角
//1.先创建一个二维数组，只用给行数10行
int[][] yangHui = new int[10][];
//2.创建列数，每一行的列数都比上一行多一列
for(int i = 0;i < yangHui.length;i++){
//yangHui[0] = new int[1];
//yangHui[1] = new int[2];
yangHui[i] = new int[i+1];
//4.给首位与末位的值赋值1
yangHui[i][0] = 1;
yangHui[i][i] = 1; //每列都为i列
//5.给没行除了首位和末位的数赋值，杨辉三角中的数字都为上一行的和自己上面一行的数字相加
for(int j = 1;j < yangHui[i].length-1;j++){ //j要从1开始，length-1排除首位与末位
yangHui[i][j] = yangHui[i-1][j-1] + yangHui[i-1][j];
}
}
//3.遍历二维数组
for(int[] a :yangHui){
for(int b : a){
System.out.print(b+"\t");
}
System.out.println();
}
System.out.println("\n");
}
}