LeetCode:54. Spiral Matrix 螺旋矩阵(C语言)

题目描述：
给定一个包含 m x n 个元素的矩阵（m 行, n 列），请按照顺时针螺旋顺序，返回矩阵中的所有元素。

示例 1:

输入:
[
[ 1, 2, 3 ],
[ 4, 5, 6 ],
[ 7, 8, 9 ]
]
输出: [1,2,3,6,9,8,7,4,5]

示例 2:

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

来源：力扣（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(0 == matrixSize)
    {
        *returnSize = 0;
        return NULL;
    }

    int *res = (int*)malloc(sizeof(int)*matrixSize*(*matrixColSize));

    int i = 0;
    int temp = 0;
    int up = 0;
    int down = matrixSize - 1;
    int left = 0;
    int right = *matrixColSize - 1;

    while(up <= down&&left <= right)
    {
        for(i = left;i <= right;i++) //一行
        {
            res[temp] = matrix[up][i];
            temp++;
        }

        up++;
        if(up > down)
        {
            break;
        }

        for(i = up;i <= down;i++)
        {
            res[temp] = matrix[i][right];
            temp++;
        }

        right--;
        if(left > right)
        {
            break;
        }

        for(i = right;i >= left; i--)
        {
            res[temp] = matrix[down][i];
            temp++;
        }

        down--;
        if(up > down)
        {
            break;
        }

        for(i = down; i >= up;i--)
        {
            res[temp] = matrix[i][left];
            temp++;
        }

        left++;
        if(left > right)
        {
            break;
        }
    }

    *returnSize = temp;
    return res;
}

运行结果：