package cn.itcast.domain; public class Text { public static void printYanghui(int n) { int[][] a = new int[n][n]; for (int i = 0; i < n; i++) { a[i][0] = 1; a[i][i] = 1; if (i >= 2) { for (int j = 1; j < i; j++) { a[i][j] = a[i - 1][j] + a[i - 1][j - 1]; } } } for (int i =n-1; i>=0; i--) { for (int j = 0; j <=i; j++) { System.out.print(a[i][j]+" " ); } System.out.println(); } } public static void main (String[]args){ printYanghui(5); } }
java实现倒杨辉三角形(改变行的输出实现
最新推荐文章于 2022-11-15 08:27:34 发布