leetcode 54. 螺旋矩阵

给你一个 m 行 n 列的矩阵 matrix ，请按照 顺时针螺旋顺序 ，返回矩阵中的所有元素。

示例 1：

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

示例 2：

输入：matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
输出：[1,2,3,4,8,12,11,10,9,5,6,7]

提示：

m == matrix.length
n == matrix[i].length
1 <= m, n <= 10
-100 <= matrix[i][j] <= 100

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

认证学习了官网给出的解析，层层遍历的方法：

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
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 total = rows * columns;
    int *res = (int *)malloc(sizeof(int) * total);
    
    *returnSize = 0;
    int left = 0, right = columns - 1, top = 0, bottom = rows - 1;
    
    while (left <=right && top <= bottom) {
        for (int column = left; column <= right; column++) {
            res[(*returnSize)++] = matrix[top][column];
        }

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

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

            for (int row = bottom; row > top; row--) {
                res[(*returnSize)++] = matrix[row][left];
            }
        }

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

    return res;
}