给你一个 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
解答
模拟:
class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
if(matrix.empty() || matrix[0].empty())
return {};
int rows = matrix.size();
int cols = matrix[0].size();
int up = 0, down = rows - 1, left = 0, right = cols - 1;
vector<int> result;
while(1){
// 打印最上面一行
for(int i = left; i <= right; i++){
result.push_back(matrix[up][i]);
}
if(++up > down)
break;
// 打印最右边一列
for(int i = up; i <= down; i++){
result.push_back(matrix[i][right]);
}
if(--right < left)
break;
// 打印最下面一行
for(int i = right; i >= left; i--){
result.push_back(matrix[down][i]);
}
if(--down < up)
break;
// 打印最左侧一列
for(int i = down; i >= up; i--){
result.push_back(matrix[i][left]);
}
if(++left > right)
break;
}
return result;
}
};
参考评论区的简洁写法,顺时针下方向变化为(0, 1)->(1, 0)->(0, -1)->(-1, 0)->(0, 1)...
,即(dx, dy) = (dy, -dx)
。将遍历的元素置一标志位,若遍历到则表示需要改变方向:
class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
vector<int> result;
int x = 0, y = 0;
int dx = 0, dy = 1;
int rows = matrix.size(), cols = matrix[0].size();
for(int i = 0; i < rows * cols; i++) {
result.push_back(matrix[x][y]);
// 题目规定矩阵元素的范围小于100
matrix[x][y] = 101;
// C++ 负数求模会溢出
if(matrix[(x + dx + rows) % rows][(y + dy + cols) % cols] == 101){
int temp = -dx;
dx = dy;
dy = temp;
}
x += dx;
y += dy;
}
return result;
}
};