LeetCode 59. 螺旋矩阵 II
原题链接
中等
作者:
bruce
,
2021-01-26 11:27:57
,
所有人可见
,
阅读 230
vector<vector<int>> generateMatrix(int n)
{
vector<vector<int>> res(n, vector<int>(n));
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
vector<vector<bool>> state(n, vector<bool>(n));
for (int i = 0, x = 0, y = 0, d = 0; i < n * n; i++)
{
res[x][y] = i + 1;
state[x][y] = true;
int a = dx[d] + x;
int b = dy[d] + y;
if (a < 0 || a >= n || b < 0 || b >= n || state[a][b])
{
d = (d + 1) % 4;
a = dx[d] + x;
b = dy[d] + y;
}
x = a, y = b;
}
return res;
}