From 6b8b526dbfd646b46a997d4c001c248e11b2c10f Mon Sep 17 00:00:00 2001
From: qiufeihong2018 <15058301288@163.com>
Date: Thu, 11 Apr 2024 17:20:55 +0800
Subject: [PATCH] =?UTF-8?q?refactor:=20=E4=BC=98=E5=8C=96=200209.=E9=95=BF?=
 =?UTF-8?q?=E5=BA=A6=E6=9C=80=E5=B0=8F=E7=9A=84=E5=AD=90=E6=95=B0=E7=BB=84?=
 =?UTF-8?q?.md=20=E7=9A=84=20Typescript=20=E5=86=99=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0209.长度最小的子数组.md b/problems/0209.长度最小的子数组.md
index 5934d5e3..d2dfe1ee 100644
--- a/problems/0209.长度最小的子数组.md
+++ b/problems/0209.长度最小的子数组.md
@@ -270,22 +270,21 @@ var minSubArrayLen = function(target, nums) {
 
 ```typescript
 function minSubArrayLen(target: number, nums: number[]): number {
-    let left: number = 0, right: number = 0;
-    let res: number = nums.length + 1;
-    let sum: number = 0;
-    while (right < nums.length) {
-        sum += nums[right];
-        if (sum >= target) {
-            // 不断移动左指针，直到不能再缩小为止
-            while (sum - nums[left] >= target) {
-                sum -= nums[left++];
-            }
-            res = Math.min(res, right - left + 1);
-        }
-        right++;
+  let left: number = 0,
+    res: number = Infinity,
+    subLen: number = 0,
+    sum: number = 0;
+  for (let right: number = 0; right < nums.length; right++) {
+    sum += nums[right];
+    while (sum >= target) {
+      subLen = right - left + 1;
+      res = Math.min(res, subLen);
+      sum -= nums[left];
+      left++;
     }
-    return res === nums.length + 1 ? 0 : res;
-};
+  }
+  return res === Infinity ? 0 : res;
+}
 ```
 
 ### Swift: