C语言 | Leetcode C语言题解之第54题螺旋矩阵

最新推荐文章于 2024-05-06 08:56:15 发布

原创

最新推荐文章于 2024-05-06 08:56:15 发布 · 607 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C语言 #Leetcode #题解

题目：

题解：

int directions[4][2] = {
  
  {0, 1}, {1, 0}, {0, -1}, {-1, 0}};

int* spiralOrder(int** matrix, int matrixSize, int* matrixColSize, int* returnSize) {
    if (matrixSize == 0 || matrixColSize[0] == 0) {
        *returnSize = 0;
        return NULL;
    }

    int rows = matrixSize, columns = matrixColSize[0];
    int visited[rows][columns];
    memset(visited, 0, sizeof(visited));
    int total = rows * columns;
    int* order = malloc(sizeof(int) * total);
    *returnSize = total;

    int row = 0, column = 0;
    int directionIndex = 0;
    for (int i = 0; i < total; i++) {
        order[i] = matrix[row][column];
        visited[row][column] = true;
        int nextRow = row + directions[directionIndex][0], nextColumn = column + directions[directionIndex][1];