赵二的刷题日记002《杨辉三角》

public class YHSJ {
    public static void main(String[] args) {
        Scanner s1 = new Scanner(System.in);
        int n =s1.nextInt();

        int[][] yanghui = new int[n][n];//创建一个n行n列的数组来保存杨辉三角

        for (int i = 0; i < n; i++) {
            for (int j = 0; j <= i; j++) {
                if (j == 0 || j == i) {//第0列和最后一列都是1
                    yanghui[i][j] = 1;
                } else {//其他的情况等于它肩膀上的两个数的和
                    yanghui[i][j] = yanghui[i - 1][j - 1] + yanghui[i - 1][j];
                }
                System.out.print(yanghui[i][j] + ' ');
            }
            if (i != (n - 1)) {//最后一行就不换行了
                System.out.println();
            }
        }
    }
}