给你一个 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
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
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];//将当前位置元素存储到order数组中
visited[row][column] = true; //将当前位置标记为已访问
int nextRow = row + directions[directionIndex][0], nextColumn = column + directions[directionIndex][1];//计算下一个要访问的位置
//如果下一个位置超出了矩阵范围或者已经访问过,则改变方向
if (nextRow < 0 || nextRow >= rows || nextColumn < 0 || nextColumn >= columns || visited[nextRow][nextColumn]) {
directionIndex = (directionIndex + 1) % 4;
}
row += directions[directionIndex][0];//根据新方向更新位置
column += directions[directionIndex][1];
}
return order;
}