public class dawdaw456 {
/*
杨辉三角
*/
public static void main(String[] args) {
int count = 10;
int[][] yanghui = new int[count][];
//给数组元素赋值
for (int i = 0; i < yanghui.length; i++) {
yanghui[i] = new int[i + 1];
yanghui[i][0] = 1;
yanghui[i][i] = 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();
}
}
}
java基础-算法-数组实现杨辉三角的输出
最新推荐文章于 2023-02-22 16:59:13 发布