LeetCode 59. 螺旋矩阵 II

题目描述

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

示例 1：

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

示例 2：

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

题解

C语言

/**
 * 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)
{

    // 先申请空间
    *returnSize = n;
    *returnColumnSizes = (int *) malloc(sizeof(int) * n);
    int **matrix = (int **) malloc(sizeof(int *) * n);
    for (int i = 0; i < n; i++) {
        matrix[i] = (int *) malloc(sizeof(int) * n);
        memset(matrix[i], 0, sizeof(int) * n);
        (*returnColumnSizes)[i] = n;
    }

    int curNum = 1;
    int maxNum = n * n;
    int row = 0;
    int col = 0;
    int start = 0;
    int end = n - 1;
    while (curNum < maxNum) {
        // 矩阵上边 1,2
        for (row = start, col = start; col < end; col++) {
            matrix[row][col] = curNum++;
        }

        // 矩阵右边 3,4
        for (; row < end; row++) {
            matrix[row][col] = curNum++;
        }

        // 矩阵下边 5,6
        for (; col > start; col--) {
            matrix[row][col] = curNum++;
        }

        // 矩阵左边 7,8
        for (; row > start; row--) {
            matrix[row][col] = curNum++;
        }

        start++;
        end--;
    }
    // 如果n为奇数，设置最中间位置 9
    if (start == end) {
        matrix[start][end] = curNum;
    }

    return matrix;
}