蛇行矩阵-题解（Java代码）

import java.util.Scanner;
//[算法提高VIP]Pascal三角
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n=in.nextInt();
        int [][] numbers=new int[n][n];
        int m=2,v=1;
        numbers[0][0]=1;
        for (int i = 1; i < n; i++) {        
            numbers[i][0]=numbers[i-1][0]+v;
            v++;
        }
        for (int i = 0; i < n; i++) {            
            for (int j = 1; j < (n-i); j++) {
                numbers[i][j]=numbers[i][j-1]+m;
                m++;
            }
            m=2+i+1;
        }
        for (int i = 0; i < n; i++) {            
            for (int j = 0; j < (n-i); j++) {
                System.out.print(numbers[i][j]+" ");
            }
            System.out.println();
        }
    }
}