Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.
For example,
Given the following matrix:
[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ] ]
You should return [1,2,3,6,9,8,7,4,5]
.
给定一个矩阵,按照螺旋的方式输出,其实就是按照上->右->下->左的顺序,依次从外层一直遍历到矩阵的中心。
根据螺旋方式访问的特点,使用四个变量up,right,down,left分别来记录四个方向访问的层次。
AC code:
class Solution {
public:
vector<int> spiralOrder(vector<vector<int> > &matrix)
{
vector<int> ret;
if(matrix.empty())
return ret;
int left=0,right=matrix[0].size()-1,up=0,down=matrix.size()-1;
while(left<=right&&up<=down)
{
for(int i=left;i<=right;i++)
ret.push_back(matrix[up][i]);
++up;
if(up>down)
break;
for(int i=up;i<=down;i++)
ret.push_back(matrix[i][right]);
--right;
if(right<left)
break;
for(int i=right;i>=left;i--)
ret.push_back(matrix[down][i]);
--down;
if(up>down)
break;
for(int i=down;i>=up;i--)
ret.push_back(matrix[i][left]);
++left;
}
}
};