题解 | #蛇形矩阵# C++

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin >> n;
    vector<vector<int>> nums(n, vector<int>(n, 0));
    int index = 1;
    int num = 2;
    nums[0][0] = 1;
    while(index < n)
    {
        for(int i = 0; i <= index; ++i)
        {
            nums[index - i][i] = num++;
        }
        index++;
    }
    while(index > 0)
    {
        for(int i = 0; i < index - 1; ++i)
        {
            cout << nums[n - index][i] << " ";
        }
        cout << nums[n - index][index - 1] << endl;
        index--;
    }
    return 0;
}