/*
* @lc app=leetcode.cn id=59 lang=typescript
*
* [59] 螺旋矩阵 II
*/下面提供两种解法
//详细解法讲解见代码随想录(左闭右开)
// @lc code=start
function generateMatrix(n: number): number[][] {
let loopnum = 0,
startx = 0,
starty = 0,
count = 1,
i = 0,
j = 0,
offset = 1;
let res: number[][] = new Array(n).fill(1).map((i) => new Array(n));
while (loopnum++ < Math.floor(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++;
}
//赋值中心元素
if (n % 2 === 1) {
res[startx][starty] = count;
}
return res;
}
// @lc code=end
讲解见力扣或我的54题题解(左闭右闭)
//点此
// @lc code=start
function generateMatrix(n: number): number[][] {
let num = 1,
top = 0,
left = 0,
right = n - 1,
bottom = n - 1,
targrt = n * n,
i = 0,
j = 0;
let res: number[][] = new Array(n).fill(1).map((i) => new Array(n));
while (num <= targrt) {
for (i = left; i <= right; i++) {
res[top][i] = num++;
}
//向下塌陷一排
top++;
for (j = top; j <= bottom; j++) {
res[j][right] = num++;
}
//向左移动一列
right--;
for (i = right; i >= left; i--) {
res[bottom][i] = num++;
}
//向上移动一排
bottom--;
for (j = bottom; j >= top; j--) {
res[j][left] = num++;
}
//向右移动一列
left++;
}
return res;
}
// @lc code=end