顺时针打印矩阵
题目
输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字。
样例
输入:
[
[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> printMatrix(vector<vector<int> > matrix) {
vector<int> ans;
if (matrix.empty()) return ans;
int n = matrix.size(), m = matrix[0].size();
vector<vector<bool> > g(n, vector<bool>(m, false));
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}, u = 0, x = 0, y = 0;
for (int i = 0; i < n * m; i ++) {
g[x][y] = true;
ans.push_back(matrix[x][y]);
int a = x + dx[u], b = y + dy[u];
if (a < 0 || b < 0 || a >= n || b >= m || g[a][b]) {
u = (u + 1) % 4;
a = x + dx[u], b = y + dy[u];
}
x = a, y = b;
}
return ans;
}
};