基础练习 杨辉三角形
Problem:
AcCode:
import java.util.Scanner;
public class BASIC_6 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[][] nums = new int[n][n];
for (int i = 0; i < nums.length; i++) {
nums[i][0] = 1;
}
for(int i = 1;i<nums.length;i++) {
for (int j = 1; j <= i; j++) {
nums[i][j] = nums[i-1][j-1]+nums[i-1][j];
}
}
for (int i = 0; i < nums.length; i++) {
for (int j = 0; j < nums[i].length; j++) {
if(nums[i][j]!=0) {
System.out.print(nums[i][j]+" ");
}
}
System.out.println();
}
}
}