杨辉三角Java写法
public static void main(String[] args) {
//1.声明二维数组并初始化
int[][] yangHui = new int[10][];
//2.给元素赋值
for (int i = 0;i<yangHui.length;i++) {
yangHui[i] = new int[i + 1];
//2.1给首个元素赋值
yangHui[i][0] = yangHui[i][i] = 1;
//2.2给每行非首末元素赋值
for (int j = 1;j< yangHui[i].length - 1;j++){
yangHui[i][j] = yangHui[i-1][j-1] + yangHui[i-1][j];
}
}
//3.遍历
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();
}
}