给定一个包含 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>>& m) {
vector<int> res;
if (m.size() == 0) return res;
int row = m.size(), col = m[0].size();
int i = 0, j = 0, cnt = 0, layer = 0;
while (cnt < row*col) {
while (j < col-layer && cnt < row*col) {
res.push_back(m[i][j]);
j++;
cnt++;
}
i++;
j--;
while (i < row-layer && cnt < row*col) {
res.push_back(m[i][j]);
i++;
cnt++;
}
i--;
j--;
while (j >= layer && cnt < row*col) {
res.push_back(m[i][j]);
j--;
cnt++;
}
i--;
j++;
while (i >layer && cnt < row*col) {
res.push_back(m[i][j]);
i--;
cnt++;
}
layer++;
i = j = layer;
}
return res;
}
};