打印螺旋矩阵可以说在面试中出现频率较高的题目,本题并不涉及到什么算法,就是模拟过程,但却十分考察对代码的掌控能力。
首先从 剑指 Offer 29. 顺时针打印矩阵 LCOF 开始,理解easy的题目后面的 螺旋矩阵(54. Spiral Matrix)和螺旋矩阵II (59. Spiral Matrix II)就都轻而易举的拿下了。
模拟顺时针画矩阵的过程:
- 从左到右
- 从上到下
- 从右到左
- 从下到上
所以我们可以定义left、right、up和down来记录遍历的顺序。只要理清楚它所遍历的顺序,就可以轻松地写出模拟的过程了。
所以offer 29.顺时针打印矩阵的代码如下:
class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
if (matrix.size() == 0 || matrix[0].size() == 0)
return {};
int m = matrix.size(), n = matrix[0].size();
int left = 0, right = n-1, up = 0, down = m-1;
vector<int> res;
while(true)
{
// left to right
for(int i = left;i <= right;i++)
res.push_back(matrix[up][i]);
if(++up > down) break;
// up to down
for(int i = up;i <= down;i++)
res.push_back(matrix[i][right]);
if(--right < left) break;
// right to left
for(int i = right;i >= left;i--)
res.push_back(matrix[down][i]);
if(--down < up) break;
// down to up
for(int i = down;i >= up;i--)
res.push_back(matrix[i][left]);
if(++left > right) break;
}
return res;
}
};
同理:
54.Spiral MatrixII
class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
int m = matrix.size(), n = matrix[0].size();
vector<int> res;
int left = 0, right = n - 1,top = 0, bottom = m - 1;
while(true)
{
for(int i = left;i <= right;i++)
res.push_back(matrix[top][i]);
if(++top > bottom) break;
for(int i = top;i <= bottom;i++)
res.push_back(matrix[i][right]);
if(--right < left) break;
for(int i = right;i >= left;i--)
res.push_back(matrix[bottom][i]);
if(--bottom < top) break;
for(int i = bottom;i >= top;i--)
res.push_back(matrix[i][left]);
if(++left > right) break;
}
return res;
}
};
59.Spiral Matrix
class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
vector<vector<int>> res(n,vector<int>(n,0));
int left = 0, right = n-1, top = 0,bottom = n-1;
int start = 1;
while(start <= n*n)
{
//left to right
for(int i = left;i <= right;i++)
res[top][i] = start++;
top++;
//top to bottom
for(int i = top;i <= bottom;i++)
res[i][right] = start++;
--right;
//right to left
for(int i = right;i >= left;i--)
res[bottom][i] = start++;
--bottom;
//bottom to top
for(int i = bottom;i >= top;i--)
res[i][left] = start++;
++left;
}
return res;
}
};
可以说是一模一样了。