[leetcode-54]Spiral Matrix(C语言)

最新推荐文章于 2024-01-18 22:53:02 发布

zdavb

最新推荐文章于 2024-01-18 22:53:02 发布

阅读量1k

点赞数

分类专栏： leetcode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/zdavb/article/details/46808425

版权

leetcode 专栏收录该内容

243 篇文章 0 订阅

订阅专栏

问题描述：
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.

For example,
Given the following matrix:

[
[ 1, 2, 3 ],
[ 4, 5, 6 ],
[ 7, 8, 9 ]
]
You should return [1,2,3,6,9,8,7,4,5].

这道题没啥可说的，上代码：

int* spiralOrder(int** matrix, int matrixRowSize, int matrixColSize) {
        int length = matrixRowSize*matrixColSize;
    int *result = (int *)malloc(sizeof(int)*length);
    char *visited = (char *)calloc(length,sizeof(char));//store visited element

    int index = 0;
    int row=0,col=-1;
    while(1){
        if(index == length)
            break;
        for(col=col+1;col<matrixColSize;col++){
            if(visited[row*matrixColSize+col] == 1)         
                break;
            result[index++]=matrix[row][col];
            visited[row*matrixColSize+col] = 1;
        }
        col--;
        for(row = row+1;row<matrixRowSize;row++){
            if(visited[row*matrixColSize+col] == 1)
                break;
            result[index++] = matrix[row][col];
            visited[row*matrixColSize+col] = 1;
        }
        row--;
        for(col = col-1;col>=0;col--){
            if(visited[row*matrixColSize+col] == 1)
                break;
            result[index++] = matrix[row][col];
            visited[row*matrixColSize+col] = 1;
        }
        col++;
        for(row = row-1;row>=0;row--){
            if(visited[row*matrixColSize+col] == 1)         
                break;
            result[index++] = matrix[row][col];
            visited[row*matrixColSize+col] = 1;
        }
        row++;
    }
    return result;
}