题目:
给你一个正整数 n
,生成一个包含 1
到 n2
所有元素,且元素按顺时针顺序螺旋排列的 n x n
正方形矩阵 matrix
。
示例 1:
输入:n = 3 输出:[[1,2,3],[8,9,4],[7,6,5]]
示例 2:
输入:n = 1 输出:[[1]]
提示:
1 <= n <= 20
题解:
class Solution {
public int[][] generateMatrix(int n) {
int[][] res = new int[n][n];
int loop = 1;
int startX = 0;
int startY = 0;
int offset = 1;
int i, j = 0;
int count = 1; //数字
while (loop <= n / 2) {
//顶部
for (j = startY; j < n - offset; j++) {
res[startX][j] = count++;
}
//右边
for (i = startX; i < n - offset; i++) {
res[i][j] = count++;
}
//底部
for (; j > startY; j--) {
res[i][j] = count++;
}
//左边
for (; i > startX; i--) {
res[i][j] = count++;
}
startX++;
startY++;
offset++;
loop++;
}
if (n % 2 == 1) {
res[startX][startY] = count;
}
return res;
}
}