From 3374f8e875cdd0e77bfbc3db03fcaa497029b817 Mon Sep 17 00:00:00 2001
From: ZGQ <gangqingzhao321@163.com>
Date: Sat, 1 Oct 2022 16:35:27 +0800
Subject: [PATCH] =?UTF-8?q?feat:0090.=E5=AD=90=E9=9B=86=E2=85=A1=E5=A2=9E?=
 =?UTF-8?q?=E5=8A=A0Typescript=E7=9A=84set=E5=8E=BB=E9=87=8D=E7=89=88?=
 =?UTF-8?q?=E6=9C=AC=E9=A2=98=E8=A7=A3?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0090.子集II.md | 33 +++++++++++++++++++++++++++++++++
 1 file changed, 33 insertions(+)

diff --git a/problems/0090.子集II.md b/problems/0090.子集II.md
index 9e7e3bd0..81c0f94a 100644
--- a/problems/0090.子集II.md
+++ b/problems/0090.子集II.md
@@ -367,6 +367,39 @@ function subsetsWithDup(nums: number[]): number[][] {
 };
 ```
 
+set去重版本:
+```typescript
+// 使用set去重版本
+function subsetsWithDup(nums: number[]): number[][] {
+    const result: number[][] = [];
+    const path: number[] = [];
+    // 去重之前先排序
+    nums.sort((a, b) => a - b);
+    function backTracking(startIndex: number) {
+        // 收集结果
+        result.push([...path])
+        // 此处不返回也可以因为，每次递归都会使startIndex + 1，当这个数大到nums.length的时候就不会进入递归了。
+        if (startIndex === nums.length) {
+            return
+        }
+        // 定义每一个树层的set集合
+        const set: Set<number> = new Set()
+        for (let i = startIndex; i < nums.length; i++) {
+            // 去重
+            if (set.has(nums[i])) {
+                continue
+            }
+            set.add(nums[i])
+            path.push(nums[i])
+            backTracking(i + 1)
+            // 回溯
+            path.pop()
+        }
+    }
+    backTracking(0)
+    return result
+};
+```
 ### Rust
 
 ```Rust