C语言入门-leetcode练习之第59题螺旋矩阵II.zip

#include <stdio.h> #include <stdlib.h> /** * Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array and *returnColumnSizes array must be malloced, assume caller calls free(). */ int** generateMatrix(int n, int* returnSize, int** returnColumnSizes) { int i; int **matrix = malloc(n * sizeof(int *)); int *nums = malloc(n * n * sizeof(int)); *returnSize = n; *returnColumnSizes = malloc(n * sizeof(int)); for (i = 0; i < n; i++) { matrix[i] = &nums[i * n]; (*returnColumnSizes)[i] = n; } int direction = 0; int hor_top = 0; int hor_bottom = n - 1; int ver_left = 0; int ver_right = n - 1; int num = 0; while (num < n * n) { switch (direction) { case 0: for (i = ver_left; i <= ver_right; i++) { matrix[hor_top][i] = ++num; } hor_top++; break; case 1: for (i = hor_top; i <= hor_bottom; i++) { matrix[i][ver_right] = ++num; } ver_right--; break; case 2: for (i = ver_right; i >= ver_left; i--) { matrix[hor_bottom][i] = ++num; } hor_bottom--; break; case 3: for (i = hor_bottom; i >= hor_top; i--) { matrix[i][ver_left] = ++num; } ver_left++; break; } direction++; direction %= 4; } return matrix; } int main(int argc, char **argv) { if (argc != 2) { fprintf(stderr, "Usage: ./test n\n"); exit(-1); } int i, j, count; int n = atoi(argv[1]); int *col_sizes; int **matrix = generateMatrix(n, &count, &col_sizes); for (i = 0; i < n; i++) { for (j = 0; j < n; j++) { printf("%d ", matrix[i][j]); } printf("\n"); } return 0; }