难度:中等
给定一个包含 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]
题目分析:
按行按列打印即可,本题的难点在打印到最后,可能会重复打印的情况。所以规范边界条件:1.当只剩下一行时,下边就不打印;2.当只剩下一列时,左边就不打印
参考代码:
class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
vector<int> res;
//要考虑为空的情况
if (matrix.empty() || matrix[0].empty())
return res;
int left = 0;
int right = matrix[0].size() - 1;
int up = 0;
int down = matrix.size() - 1;
//要考虑两边的情况
while (left <= right && up <= down)
{
//上边
for (int i = left; i <= right; ++i)
{
res.push_back(matrix[up][i]);
}
//右边
for (int i = up + 1; i <= down; ++i)
{
res.push_back(matrix[i][right]);
}
//下边
if (up != down) //要考虑只剩下一行的情况,不能重复打印
for (int i = right - 1; i >= left; --i)
{
res.push_back(matrix[down][i]);
}
//左边
if (left != right)//要考虑只剩下一列的情况,不能重复打印
for (int i = down - 1; i >= up + 1; --i)
{
res.push_back(matrix[i][left]);
}
left++;
right--;
up++;
down--;
}
return res;
}
};