力扣59题:给定一个正整数 n,生成一个包含 1 到 n2 所有元素,且元素按顺时针顺序螺旋排列的正方形矩阵。
示例:
输入: 3
输出:
[
[ 1, 2, 3 ],
[ 8, 9, 4 ],
[ 7, 6, 5 ]
]
方法1
class Solution {
public int[][] generateMatrix(int n) {
int l = 0, r = n - 1, t = 0, b = n - 1;
int[][] mat = new int[n][n];
int num = 1, tar = n * n;
while(num <= tar){
for(int i = l; i <= r; i++) mat[t][i] = num++; // left to right.
t++;
for(int i = t; i <= b; i++) mat[i][r] = num++; // top to bottom.
r--;
for(int i = r; i >= l; i--) mat[b][i] = num++; // right to left.
b--;
for(int i = b; i >= t; i--) mat[i][l] = num++; // bottom to top.
l++;
}
return mat;
}
}
方法2:
class Solution {
public:
vector<vector<int>> generateMatrix(int n)
{
vector<vector<int>>result(n, vector<int>(n, 0));
int num = 1;
int sum = n * n;
int x = 0, y = 0;
while (num <= sum)
{
while (y < n && result[x][y] == 0)//向右
result[x][y++] = num++;
x++, y--;//向下移一位,y已经变成了n
while (x < n && result[x][y] == 0)//向下
result[x++][y] = num++;
y--, x--;
while (y >= 0 && result[x][y] == 0)//向左
result[x][y--] = num++;
x--, y++;
while (x >= 0 && result[x][y] == 0)//向上
result[x--][y] = num++;
y++, x++;
n--;
}
return result;
}
};
参考于leetcode题解。