From fb5571f16576d9d16274219d60674662970366ec Mon Sep 17 00:00:00 2001
From: Steve2020 <841532108@qq.com>
Date: Sat, 2 Apr 2022 11:24:06 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=EF=BC=880491.=E9=80=92?=
 =?UTF-8?q?=E5=A2=9E=E5=AD=90=E5=BA=8F=E5=88=97.md=EF=BC=89=EF=BC=9A?=
 =?UTF-8?q?=E5=A2=9E=E5=8A=A0typescript=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0491.递增子序列.md | 28 ++++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)

diff --git a/problems/0491.递增子序列.md b/problems/0491.递增子序列.md
index 6103c3d0..3ea2382b 100644
--- a/problems/0491.递增子序列.md
+++ b/problems/0491.递增子序列.md
@@ -396,7 +396,35 @@ var findSubsequences = function(nums) {
 
 ```
 
+## TypeScript
+
+```typescript
+function findSubsequences(nums: number[]): number[][] {
+    const resArr: number[][] = [];
+    backTracking(nums, 0, []);
+    return resArr;
+    function backTracking(nums: number[], startIndex: number, route: number[]): void {
+        let length: number = nums.length;
+        if (route.length >= 2) {
+            resArr.push(route.slice());
+        }
+        const usedSet: Set<number> = new Set();
+        for (let i = startIndex; i < length; i++) {
+            if (
+                nums[i] < route[route.length - 1] ||
+                usedSet.has(nums[i])
+            ) continue;
+            usedSet.add(nums[i]);
+            route.push(nums[i]);
+            backTracking(nums, i + 1, route);
+            route.pop();
+        }
+    }
+};
+```
+
 ### C 
+
 ```c
 int* path;
 int pathTop;