题解 | #蛇形矩阵#

通过二维数组存储！！！

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        while (in.hasNextInt()) {
            int n = in.nextInt();
            int arr[][] = new int[n][n];//通过二维数组存储
            int sum = 0;

            for(int i = 0; i<n; i++){
                int t = i;
                for(int j = 0; j<=i; j++, t--){
                    sum++;
                    arr[j][t] = sum;  
                }
            }
            //遍历数组
            for(int i = 0; i<n; i++){
                for(int j = 0; j<n-i; j++){
                    System.out.print(arr[j][i] + " ");
                }
                System.out.println();
            }


        }
    }
}