Java实现杨辉三角
import java.util.Scanner;
public class YangHTrisngleTest {
public static void main(String[] args) {
System.out.println("请输入行数:");
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[][] a = new int[n][];
for(int i = 0 ; i < n;i++){
a[i] = new int[i+1];
for (int j = 0; j <= i; j++){
if (j != i&&j != 0&&i != 0)
a[i][j] = a[i-1][j-1] + a[i-1][j];
else
a[i][j] = 1;
}
}
for (int i = 0;i < n;i++){
for(int j = 0;j <= i;j++){
System.out.print(a[i][j]+" ");
}
System.out.println();
}
}
}