Spiral Matrix
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]
.
解题技巧:
在求解此题时,首先确定输出次序,如下图所示,其次是控制边界,防止重复输出,如:下边界的横坐标要大于上边界的横坐标,右边界的纵坐标要大于左边界的纵坐标。
代码:
vector<int> spiralOrder(vector< vector<int> >& matrix)
{
vector<int> res;
int m, n, t;
if(matrix.empty()) return res;
t = matrix.size()%2 == 0 ? matrix.size()/2 : matrix.size()/2 + 1;
m = matrix.size(); //行数
n = matrix[0].size(); //列数
for(int i = 0; i < t; i ++)
{
for(int j = i; j < n-i; j ++)
{
res.push_back(matrix[i][j]);
}
for(int j = i + 1; j < m-i; j ++)
{
if(n-1-i < i) break; //此处没有等于号,是为了保证只有一列时,也能正确的输出
res.push_back(matrix[j][n-1-i]);
}
for(int j = n-2-i; j >= i; j --)
{
if(m-1-i <= i) break;
res.push_back(matrix[m-1-i][j]);
}
for(int j = m-2-i; j >= i+1; j --)
{
if(n-1-i <= i) break;
res.push_back(matrix[j][i]);
}
}
return res;
}