From f6d8350d24d6d24561db7af26a123ea0101cf4ae Mon Sep 17 00:00:00 2001
From: Steve2020 <841532108@qq.com>
Date: Sun, 2 Jan 2022 23:24:52 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=EF=BC=880209.=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=EF=BC=89=EF=BC=9A=E5=A2=9E=E5=8A=A0typescript=E7=89=88?=
 =?UTF-8?q?=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0209.长度最小的子数组.md b/problems/0209.长度最小的子数组.md
index 80822436..2c6ea775 100644
--- a/problems/0209.长度最小的子数组.md
+++ b/problems/0209.长度最小的子数组.md
@@ -214,6 +214,28 @@ var minSubArrayLen = function(target, nums) {
 };
 ```
 
+Typescript：
+
+```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++;
+    }
+    return res === nums.length + 1 ? 0 : res;
+};
+```
+
 Swift:
 
 ```swift