给定一个包含 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]
简析:这道题主要类似于一个循环,从周围开始,每绕一圈就输出一圈,剩下的矩形部分再放入迭代直到输出最后一个。
class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
vector<int> out;
if(matrix.empty())
return out;
int x1 = 0, y1 = 0, x2 = matrix[0].size()-1, y2 = matrix.size() - 1;
while(x1 <= x2 && y1<=y2)
{
for (int i = x1; i <= x2;i++)
out.push_back(matrix[y1][i]);
for (int i = y1 + 1;i<= y2;i++)
out.push_back(matrix[i][x2]);
if(x1 < x2 && y1<y2)
{
for (int i = x2 - 1; i >= x1;i--)
out.push_back(matrix[y2][i]);
for (int i = y2-1;i>y1;i--)
out.push_back(matrix[i][x1]);
}
x1++, x2--, y1++, y2--;
}
return out;
}
};