leetcode 59. 螺旋矩阵 II

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

示例 1：

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

示例 2：

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

提示：

1 <= n <= 20

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/spiral-matrix-ii
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

这个还是借助于螺旋矩阵的处理方法，按照一层层的方式去处理，从外向里一层层赋值。

/**
 * Return an array of arrays of size *returnSize.
 * The sizes of the arrays are returned as *returnColumnSizes array.
 * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
 */
int** generateMatrix(int n, int* returnSize, int** returnColumnSizes){
    int num = 1;
    int matrixSize = n * n;

    *returnColumnSizes = malloc(sizeof(int) * n);

    int **matrix = malloc(sizeof(int *) * n);
    for (int i = 0; i < n; i++) {
        matrix[i] = malloc(sizeof(int) * n);
        memset(matrix[i], 0, sizeof(int) * n);
        (*returnColumnSizes)[i] = n;
    }

    *returnSize = n;
    int left = 0, right = n - 1, top = 0, bottom = n - 1;
    
    while (left <= right && top <= bottom) {
        for (int column = left; column <= right; column++) {
            matrix[top][column] = num;
            num++;
        }

        for (int row = top + 1; row <= bottom; row++) {
            matrix[row][right] = num;
            num++;
        }

        if (left < right && top < bottom) {
            for (int column = right - 1; column >= left; column--) {
                matrix[bottom][column] = num;
                num++;
            }

            for (int row = bottom - 1; row > top; row--) {
                matrix[row][left] = num;
                num++;
            }
        }

        left++;
        right--;
        top++;
        bottom--;
    }

    return matrix;
}