题解 | #蛇形矩阵#

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        while (in.hasNextInt()) {
            int N = in.nextInt();
            int[][] dp = new int[N + 1][N + 1];
            dp[1][1] = 1;
            for (int i = 1; i <= N; i++) {
                for (int j = 1; j <= N + 1 - i; j++) {
                    if (i == 1 && j == 1) {
                        dp[i][j] = 1;
                    } else if (i == 1 && j > 1) {
                        dp[i][j] = dp[i][j - 1] + j;
                    } else if (j == 1 && i > 1) {
                        dp[i][j] = dp[i - 1][j] + (i - 1);
                    } else {
                        dp[i][j] = dp[i][j - 1] + (i + j - 1);
                    }

                    if (j != N + 1 - i) {
                        System.out.print(dp[i][j] + " ");
                    } else {
                        System.out.println(dp[i][j]);
                    }
                }
            }
        }
    }
}