59. 螺旋矩阵 II

给你一个正整数 n ，生成一个包含 1 到 n2 所有元素，且元素按顺时针顺序螺旋排列的 n x n 正方形矩阵 matrix 。

输入：n = 3
输出：[[1,2,3],[8,9,4],[7,6,5]]

示例 2：

输入：n = 1
输出：[[1]]

#include <iostream>
#include <vector>

using namespace std;

class Solution
{
public:
    vector<vector<int>> generateMatrix(int n)
    {

        int t=1, num_q=0;
        vector<vector<int>> results(n, vector<int>(n, 0));

        while (num_q < n / 2 + 1)
        {
            if (n == 1)
            {
                results[0][0] = 1;
                break;
            }
            else if (n % 2 != 0)
            {
                results[(n + 1) / 2 - 1][(n + 1) / 2 - 1] = n * n;
            }

            for (int i = num_q; i < n - (num_q + 1); i++, t++)
                results[num_q][i] = t;
            for (int j = num_q; j < n - (num_q + 1); j++, t++)
                results[j][n - (num_q + 1)] = t;
            for (int k = n - (num_q + 1); k > num_q; k--, t++)
                results[n - (num_q + 1)][k] = t;
            for (int l = n - (num_q + 1); l > num_q; l--, t++)
                results[l][num_q] = t;
            num_q++;
        }

        return results;
    }
};

int main()
{
    int n = 3;

    Solution My_Solution;

    vector<vector<int>> results = My_Solution.generateMatrix(n);

    // output thie matrix
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            cout << results[i][j] << "  ";
        }
        cout << endl;
    }

    return 0;
}