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]
.
思路:按右、下、左、上的顺序逐行或列遍历数组。不过需要注意边界问题,假设当前在[x, y]位置:
向右遍历时,由于x不变,y每次加1,因此要求y要小于n-x即可;
向下遍历时,由于y不变,x每次加1,因此要求x要小于m-(n-y-1)即可;
向左遍历时,由于x不变,y每次减1,因此要求y要不小于m-x-1即可;
向上遍历时,由于y不变,x每次减1,因此要求x要不小于y+1即可。
注意:试探着进行加入,这样可以使i,j的值在范围之内。
class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
const int m = matrix.size();
if (m == 0)
return vector<int>();
const int n = matrix[0].size();
vector<int> res(m*n);
int count = 0;
int i = 0;
int j = 0;
res[count++] = matrix[i][j];//初始化,把第一个值放进去
while (count < m*n){
//turn right
while (j+1 < n - i && count < m*n){
res[count++] = matrix[i][++j];
}
//turn down
while (i+1 < m - (n - j - 1) && count < m*n){
res[count++] = matrix[++i][j];
}
//turn left
while (j-1 >= m - i - 1 && count < m*n){
res[count++] = matrix[i][--j];
}
//turn up
while (i-1 >= j + 1 && count < m*n){
res[count++] = matrix[--i][j];
}
}
return res;
}
};