主要就是一个二维数组的使用
// 1
// 1 1
// 1 2 1
// 1 3 3 1
// 1 4 6 4 1
// 1 5 10 10 5 1
// 1 6 15 20 15 6 1
yangHuiArr[i][j] = yangHuiArr[i-1][j-1] + yangHuiArr[i-1][j]
public class yangHui {
public static void main(String[] args) {
// 1
// 1 1
// 1 2 1
// 1 3 3 1
// 1 4 6 4 1
// 1 5 10 10 5 1
// 1 6 15 20 15 6 1
//yangHuiArr[i][j] = yangHuiArr[i-1][j-1] + yangHuiArr[i-1][j]
//杨辉三角
int[][] yangHuiArr = new int[10][];
for (int i = 0; i < yangHuiArr.length; i++) {
//创建每一个数组元素 如1 ; 1 2 1
yangHuiArr[i] = new int[i + 1];
for (int j = 0; j < yangHuiArr[i].length; j++) {
if (j != 0 && j != yangHuiArr[i].length - 1) {
yangHuiArr[i][j] = yangHuiArr[i-1][j - 1] + yangHuiArr[i - 1][j];
} else {
yangHuiArr[i][j] = 1;
}
}
}
for (int i = 0; i < yangHuiArr.length; i++) {
for (int j = 0; j < yangHuiArr[i].length; j++) {
System.out.print(yangHuiArr[i][j] + "\t");
}
System.out.println();
}
}
}
结果