题解 | #蛇形矩阵#

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n;
    cin >> n;
    int ele = 1;
    vector<vector<int>> snake_arr(n, vector<int>(n));
    for(int sum = 0; sum < n; sum++){
        for(int i = sum; i >= 0; i--){
            int j = sum - i;
            snake_arr[i][j] = ele;
            ele++;
        }
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(snake_arr[i][j] != 0) cout << snake_arr[i][j] << " ";
        }
        cout << endl;
    }
    return 0;
}