From 10a3433ba0b6b2a04c1a817c6dae0d2656a1a8b2 Mon Sep 17 00:00:00 2001
From: "qingyi.liu" <qingyi.liu@17zuoye.com>
Date: Thu, 20 May 2021 16:12:00 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A059.=E8=9E=BA=E6=97=8B?=
 =?UTF-8?q?=E7=9F=A9=E9=98=B5IIjavaScript=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0059.螺旋矩阵II.md | 43 +++++++++++++++++++++++++++++++++
 1 file changed, 43 insertions(+)

diff --git a/problems/0059.螺旋矩阵II.md b/problems/0059.螺旋矩阵II.md
index 5e2d48d8..39cd2ffa 100644
--- a/problems/0059.螺旋矩阵II.md
+++ b/problems/0059.螺旋矩阵II.md
@@ -224,6 +224,49 @@ class Solution:
         return matrix
 ```
 
+javaScript
+
+```js
+
+/**
+ * @param {number} n
+ * @return {number[][]}
+ */
+var generateMatrix = function(n) {
+    // new Array(n).fill(new Array(n))
+    // 使用fill --> 填充的是同一个数组地址
+    const res = Array.from({length: n}).map(() => new Array(n));
+    let loop = n >> 1, i = 0, //循环次数
+        count = 1,
+        startX = startY = 0; // 起始位置 
+    while(++i <= loop) {
+        // 定义行列
+        let row = startX, column = startY;
+        // [ startY, n - i)
+        while(column < n - i) {
+            res[row][column++] = count++;
+        }
+        // [ startX, n - i)
+        while(row < n - i) {
+            res[row++][column] = count++;
+        }
+        // [n - i ,  startY)
+        while(column > startY) {
+            res[row][column--] = count++; 
+        }
+        // [n - i ,  startX)
+        while(row > startX) {
+            res[row--][column] = count++;
+        }
+        startX = ++startY;
+    }
+    if(n & 1) {
+        res[startX][startY] = count;
+    }
+    return res;
+};
+```
+
 
 
 -----------------------