From 8c5c5c03c6e7d53385778ae8eee0876f71056080 Mon Sep 17 00:00:00 2001
From: "qingyi.liu" <qingyi.liu@17zuoye.com>
Date: Thu, 20 May 2021 14:50:56 +0800
Subject: [PATCH 1/3] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=20704.=20=E4=BA=8C?=
 =?UTF-8?q?=E5=88=86=E6=9F=A5=E6=89=BE=20javaScript=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0704.二分查找.md | 37 +++++++++++++++++++++++++++++++++++
 1 file changed, 37 insertions(+)

diff --git a/problems/0704.二分查找.md b/problems/0704.二分查找.md
index 76d4a2af..c97fd36e 100644
--- a/problems/0704.二分查找.md
+++ b/problems/0704.二分查找.md
@@ -254,6 +254,43 @@ func search(nums []int, target int) int {
 }
 ```
 
+javaScript
+
+```js
+
+// （版本一）左闭右闭区间
+
+var search = function(nums, target) {
+    let l = 0, r = nums.length - 1;
+    // 区间 [l, r]
+    while(l <= r) {
+        let mid = (l + r) >> 1;
+        if(nums[mid] === target) return mid;
+        let isSmall = nums[mid] < target;
+        l = isSmall ? mid + 1 : l;
+        r = isSmall ? r : mid - 1;
+    }
+    return -1;
+};
+
+// （版本二）左闭右开区间
+
+var search = function(nums, target) {
+    let l = 0, r = nums.length;
+    // 区间 [l, r）
+    while(l < r) {
+        let mid = (l + r) >> 1;
+        if(nums[mid] === target) return mid;
+        let isSmall = nums[mid] < target;
+        l = isSmall ? mid + 1 : l;
+        // 所以 mid 不会被取到
+        r = isSmall ? r : mid;
+    }
+    return -1;
+};
+
+```
+
 
 
 

From 9a919464bf7e70e77e97168e29591b449bdd5c30 Mon Sep 17 00:00:00 2001
From: "qingyi.liu" <qingyi.liu@17zuoye.com>
Date: Thu, 20 May 2021 15:22:05 +0800
Subject: [PATCH 2/3] =?UTF-8?q?update=20209.=E9=95=BF=E5=BA=A6=E6=9C=80?=
 =?UTF-8?q?=E5=B0=8F=E7=9A=84=E5=AD=90=E6=95=B0=E7=BB=84=20javascript?=
 =?UTF-8?q?=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0209.长度最小的子数组.md | 29 +++++++++++++----------
 1 file changed, 17 insertions(+), 12 deletions(-)

diff --git a/problems/0209.长度最小的子数组.md b/problems/0209.长度最小的子数组.md
index 0aaa466e..d5ad368d 100644
--- a/problems/0209.长度最小的子数组.md
+++ b/problems/0209.长度最小的子数组.md
@@ -175,19 +175,24 @@ Go：
 
 
 JavaScript:
-```
-var minSubArrayLen = (target, nums) => {
-    let left = 0, right = 0,win = Infinity,sum = 0;
-    while(right < nums.length){
-       sum += nums[right];
-       while(sum >= target){
-           win = right - left + 1 < win? right - left + 1 : win;
-           sum -= nums[left];
-           left++;
-       }
-       right++;
+
+```js
+
+var minSubArrayLen = function(target, nums) {
+    // 长度计算一次
+    const len = nums.length;
+    let l = r = sum = 0, 
+        res = len + 1; // 子数组最大不会超过自身
+    while(r < len) {
+        sum += nums[r++];
+        // 窗口滑动
+        while(sum >= target) {
+            // r始终为开区间 [l, r)
+            res = res < r - l ? res : r - l;
+            sum-=nums[l++];
+        }
     }
-    return win === Infinity? 0:win;
+    return res > len ? 0 : res;
 };
 ```
 

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 3/3] =?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;
+};
+```
+
 
 
 -----------------------