杨辉三角
例:(一个5行的杨辉三角)
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
下标:
[0][0]
[1][0] [1][1]
[2][0] [2][1] [2][2]
[3][0] [3][1] [3][2] [3][3]
[4][0] [4][1] [4][2] [4][3]
package YangHuiTriangle;
import java.util.Scanner;
public class YangHuiTriangle {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int x;
System.out.println("请输入行数:");
x=in.nextInt();//按自己需要的杨辉三角行数输出杨辉三角
YangHuiTriangle(x);
}
public static void YangHuiTriangle(int x) {
int[][] xx=new int[x][x];
for(int i=0;i<x;i++){
for(int j=0;j<=i;j++){
if(i==j||j==0){
xx[i][j]=1;
}else {
xx[i][j]=xx[i-1][j-1]+xx[i-1][j];
}
}
}//给杨辉三角赋值
for(int i=0;i<x;i++){
for(int j=0;j<=i;j++){
System.out.print(xx[i][j]+" ");
}
System.out.println();
}//输出杨辉三角
}
}