From 1dcbf7f6f0ba7b50da6685532a42d2ceac9aeccc Mon Sep 17 00:00:00 2001
From: Steve2020 <841532108@qq.com>
Date: Sun, 3 Apr 2022 19:43:34 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=EF=BC=88=E5=9B=9E=E6=BA=AF?=
 =?UTF-8?q?=E7=AE=97=E6=B3=95=E5=8E=BB=E9=87=8D=E9=97=AE=E9=A2=98=E7=9A=84?=
 =?UTF-8?q?=E5=8F=A6=E4=B8=80=E7=A7=8D=E5=86=99=E6=B3=95.md=EF=BC=89?=
 =?UTF-8?q?=EF=BC=9A=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

---
 ...溯算法去重问题的另一种写法.md | 81 +++++++++++++++++++
 1 file changed, 81 insertions(+)

diff --git a/problems/回溯算法去重问题的另一种写法.md b/problems/回溯算法去重问题的另一种写法.md
index b4bdda00..f48097e1 100644
--- a/problems/回溯算法去重问题的另一种写法.md
+++ b/problems/回溯算法去重问题的另一种写法.md
@@ -365,6 +365,87 @@ class Solution:
         return res
 ```
 
+TypeScript：
+
+**90.子集II**
+
+```typescript
+function subsetsWithDup(nums: number[]): number[][] {
+    nums.sort((a, b) => a - b);
+    const resArr: number[][] = [];
+    backTraking(nums, 0, []);
+    return resArr;
+    function backTraking(nums: number[], startIndex: number, route: number[]): void {
+        resArr.push(route.slice());
+        const helperSet: Set<number> = new Set();
+        for (let i = startIndex, length = nums.length; i < length; i++) {
+            if (helperSet.has(nums[i])) continue;
+            helperSet.add(nums[i]);
+            route.push(nums[i]);
+            backTraking(nums, i + 1, route);
+            route.pop();
+        }
+    }
+};
+```
+
+**40. 组合总和 II**
+
+```typescript
+function combinationSum2(candidates: number[], target: number): number[][] {
+    candidates.sort((a, b) => a - b);
+    const resArr: number[][] = [];
+    backTracking(candidates, target, 0, 0, []);
+    return resArr;
+    function backTracking(
+        candidates: number[], target: number,
+        curSum: number, startIndex: number, route: number[]
+    ) {
+        if (curSum > target) return;
+        if (curSum === target) {
+            resArr.push(route.slice());
+            return;
+        }
+        const helperSet: Set<number> = new Set();
+        for (let i = startIndex, length = candidates.length; i < length; i++) {
+            let tempVal: number = candidates[i];
+            if (helperSet.has(tempVal)) continue;
+            helperSet.add(tempVal);
+            route.push(tempVal);
+            backTracking(candidates, target, curSum + tempVal, i + 1, route);
+            route.pop();
+
+        }
+    }
+};
+```
+
+**47. 全排列 II**
+
+```typescript
+function permuteUnique(nums: number[]): number[][] {
+    const resArr: number[][] = [];
+    const usedArr: boolean[] = [];
+    backTracking(nums, []);
+    return resArr;
+    function backTracking(nums: number[], route: number[]): void {
+        if (nums.length === route.length) {
+            resArr.push(route.slice());
+            return;
+        }
+        const usedSet: Set<number> = new Set();
+        for (let i = 0, length = nums.length; i < length; i++) {
+            if (usedArr[i] === true || usedSet.has(nums[i])) continue;
+            usedSet.add(nums[i]);
+            route.push(nums[i]);
+            usedArr[i] = true;
+            backTracking(nums, route);
+            usedArr[i] = false;
+            route.pop();
+        }
+    }
+};
+```
 
 Go：