1、题目
给你一个正整数 n ,生成一个包含 1 到 n2 所有元素,且元素按顺时针顺序螺旋排列的 n x n 正方形矩阵 matrix 。
链接:https://leetcode-cn.com/problems/spiral-matrix-ii/
2、思路分析
1)按层模拟
class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
vector<int> vec;
for(int i = 1; i <= n*n; ++i){
vec.push_back(i);
}
int k = 0;
vector<vector<int>> ret(n, vector<int>(n));
int left = 0, right = n - 1;
int top = 0, bottom = n - 1;
while(left <= right && top <= bottom)
{
for(int i = left; i <= right; ++i){
ret[top][i] = vec[k++];
}
top++;
for(int i = top; i <= bottom; ++i){
ret[i][right] = vec[k++];
}
right--;
if(left < right && top < bottom){
for(int i = right; i >= left; --i){
ret[bottom][i] = vec[k++];
}
bottom--;
for(int i = bottom; i >= top; --i){
ret[i][left] = vec[k++];
}
left++;
}
}
return ret;
}
};
2)模拟
class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
int maxNum = n * n;
int curNum = 1;
vector<vector<int>> matrix(n, vector<int>(n));
int row = 0, column = 0;
vector<vector<int>> directions = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}}; // 右下左上
int directionIndex = 0;
while (curNum <= maxNum) {
matrix[row][column] = curNum;
curNum++;
int nextRow = row + directions[directionIndex][0], nextColumn = column + directions[directionIndex][1];
if (nextRow < 0 || nextRow >= n || nextColumn < 0 || nextColumn >= n || matrix[nextRow][nextColumn] != 0) {
directionIndex = (directionIndex + 1) % 4; // 顺时针旋转至下一个方向
}
row = row + directions[directionIndex][0];
column = column + directions[directionIndex][1];
}
return matrix;
}
};