杨辉三角形（java）

1.直角形的

5行

package day5;public class Demo5 {    public static void main(String[] args) { int [][]yanghui = new int [5][5]; for (int i = 0; i < yanghui.length; i++) {     yanghui[i][0] = 1;     yanghui[i][i] = 1; } for (int i = 1; i < yanghui.length; i++) {     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 <= i; j++) {  System.out.print(yanghui[i][j]+"   ");     }     System.out.println(); }    }}

运行结果：

 10行

package day5;public class Demo5 {    public static void main(String[] args) { int [][]yanghui = new int [10][10]; for (int i = 0; i < yanghui.length; i++) {     yanghui[i][0] = 1;     yanghui[i][i] = 1; } for (int i = 1; i < yanghui.length; i++) {     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 <= i; j++) {  System.out.print(yanghui[i][j]+"   ");     }     System.out.println(); }    }}

运行结果：

2.金字塔形的

10行

package day5;public class Demo5 {    public static void main(String[] args) { int [][]yanghui = new int [10][10]; for (int i = 0; i < yanghui.length; i++) {     yanghui[i][0] = 1;     yanghui[i][i] = 1; } for (int i = 1; i < yanghui.length; i++) {     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 0;j--){  System.out.print("  ");     }     for (int j = 0; j <= i; j++) {  System.out.print(yanghui[i][j]+"   ");     }     System.out.println(); }    }}

运行结果：

n行

package day5;import java.util.Scanner;public class Demo5 {    public static void main(String[] args) { Scanner s = new Scanner(System.in); int n = s.nextInt(); int [][]yanghui = new int [n][n]; for (int i = 0; i < yanghui.length; i++) {     yanghui[i][0] = 1;     yanghui[i][i] = 1; } for (int i = 1; i < yanghui.length; i++) {     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 0;j--){  System.out.print("  ");     }     for (int j = 0; j <= i; j++) {  System.out.print(yanghui[i][j]+"   ");     }     System.out.println(); }    }}

运行结果：