mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 03:34:02 +08:00
Update
This commit is contained in:
@ -211,10 +211,6 @@ class Solution:
|
|||||||
|
|
||||||
```javascript
|
```javascript
|
||||||
|
|
||||||
/**
|
|
||||||
* @param {number} n
|
|
||||||
* @return {number[][]}
|
|
||||||
*/
|
|
||||||
var generateMatrix = function(n) {
|
var generateMatrix = function(n) {
|
||||||
let startX = startY = 0; // 起始位置
|
let startX = startY = 0; // 起始位置
|
||||||
let loop = Math.floor(n/2); // 旋转圈数
|
let loop = Math.floor(n/2); // 旋转圈数
|
||||||
@ -226,11 +222,11 @@ var generateMatrix = function(n) {
|
|||||||
while (loop--) {
|
while (loop--) {
|
||||||
let row = startX, col = startY;
|
let row = startX, col = startY;
|
||||||
// 上行从左到右(左闭右开)
|
// 上行从左到右(左闭右开)
|
||||||
for (; col < startY + n - offset; col++) {
|
for (; col < n - offset; col++) {
|
||||||
res[row][col] = count++;
|
res[row][col] = count++;
|
||||||
}
|
}
|
||||||
// 右列从上到下(左闭右开)
|
// 右列从上到下(左闭右开)
|
||||||
for (; row < startX + n - offset; row++) {
|
for (; row < n - offset; row++) {
|
||||||
res[row][col] = count++;
|
res[row][col] = count++;
|
||||||
}
|
}
|
||||||
// 下行从右到左(左闭右开)
|
// 下行从右到左(左闭右开)
|
||||||
@ -247,7 +243,7 @@ var generateMatrix = function(n) {
|
|||||||
startY++;
|
startY++;
|
||||||
|
|
||||||
// 更新offset
|
// 更新offset
|
||||||
offset += 2;
|
offset += 1;
|
||||||
}
|
}
|
||||||
// 如果n为奇数的话,需要单独给矩阵最中间的位置赋值
|
// 如果n为奇数的话,需要单独给矩阵最中间的位置赋值
|
||||||
if (n % 2 === 1) {
|
if (n % 2 === 1) {
|
||||||
@ -257,6 +253,7 @@ var generateMatrix = function(n) {
|
|||||||
};
|
};
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
```
|
```
|
||||||
|
|
||||||
### TypeScript:
|
### TypeScript:
|
||||||
|
Reference in New Issue
Block a user