Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.
Example 1:
Input:
[
[ 1, 2, 3 ],
[ 4, 5, 6 ],
[ 7, 8, 9 ]
]
Output: [1,2,3,6,9,8,7,4,5]
Example 2:
Input:
[
[1, 2, 3, 4],
[5, 6, 7, 8],
[9,10,11,12]
]
Output: [1,2,3,4,8,12,11,10,9,5,6,7]
这是一道对新手不太友好的二维数组处理问题,实现起来并不难,但有时候会因为某些不必要的代码使得整个程序看起来比较繁杂,之前我已经使用Java在LeetCode中文版上实现过,最近在学C++,所以用C++实现了一遍,AC代码如下:
class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
vector<int> ans;
if (matrix.empty()) return ans;
int m = matrix.size(), n = matrix[0].size();
int b1 = 0, e1 = m - 1, b2 = 0, e2 = n - 1, t = 0;
while (true) {
// left
for (int i = b2; i <= e2; i ++) ans.push_back(matrix[b1][i]);
if (++b1 > e1) break;
// down
for (int i = b1; i <= e1; i ++) ans.push_back(matrix[i][e2]);
if (--e2 < b2) break;
// right
for (int i = e2; i >= b2; i --) ans.push_back(matrix[e1][i]);
if (--e1 < b1) break;
// up
for (int i = e1; i >= b1; i --) ans.push_back(matrix[i][b2]);
if (++b2 > e2) break;
}
return ans;
}
};