AcWing 40. 顺时针打印矩阵
原题链接
中等
作者:
SayYong
,
2024-10-20 12:26:20
,
所有人可见
,
阅读 2
class Solution {
public:
vector<int> printMatrix(vector<vector<int> > matrix) {
vector<int> res;
if (matrix.empty()) return res;
int n = matrix.size();
int m = matrix[0].size();
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int x = 0, y = 0, d = 1;
vector<vector<bool>> st(n, vector<bool>(m, false));
for (int k = 0; k < n * m; k++) {
res.push_back(matrix[x][y]);
st[x][y] = true;
int a = x + dx[d], b = y + dy[d];
if (a < 0 || a >= n || b < 0 || b >= m || st[a][b]) {
d = (d + 1) % 4;
a = x + dx[d], b = y + dy[d];
}
x = a, y = b;
}
return res;
}
};