From 77aef4b18badbd6e04e0d78d834af7fea2613027 Mon Sep 17 00:00:00 2001
From: fw_qaq <fwqaaq@gmail.com>
Date: Sun, 5 Mar 2023 10:19:41 +0800
Subject: [PATCH 1/3] =?UTF-8?q?Update=20=E5=9B=9E=E6=BA=AF=E7=AE=97?=
 =?UTF-8?q?=E6=B3=95=E5=8E=BB=E9=87=8D=E9=97=AE=E9=A2=98=E7=9A=84=E5=8F=A6?=
 =?UTF-8?q?=E4=B8=80=E7=A7=8D=E5=86=99=E6=B3=95.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/回溯算法去重问题的另一种写法.md b/problems/回溯算法去重问题的另一种写法.md
index 73862156..2265a89b 100644
--- a/problems/回溯算法去重问题的另一种写法.md
+++ b/problems/回溯算法去重问题的另一种写法.md
@@ -525,10 +525,41 @@ function permuteUnique(nums: number[]): number[][] {
 };
 ```
 
-Go：
+Rust：
 
+**90.子集II**：
 
+```rust
+use std::collections::HashSet;
+impl Solution {
+    pub fn subsets_with_dup(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
+        let mut res = vec![];
+        let mut path = vec![];
+        nums.sort();
+        Self::backtracking(&nums, &mut path, &mut res, 0);
+        res
+    }
 
+    pub fn backtracking(
+        nums: &Vec<i32>,
+        path: &mut Vec<i32>,
+        res: &mut Vec<Vec<i32>>,
+        start_index: usize,
+    ) {
+        res.push(path.clone());
+        let mut helper_set = HashSet::new();
+        for i in start_index..nums.len() {
+            if helper_set.contains(&nums[i]) {
+                continue;
+            }
+            helper_set.insert(nums[i]);
+            path.push(nums[i]);
+            Self::backtracking(nums, path, res, i + 1);
+            path.pop();
+        }
+    }
+}
+```
 
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">

From a30546d0777b41eb415d056f6f15dd4cc88e878e Mon Sep 17 00:00:00 2001
From: fw_qaq <fwqaaq@gmail.com>
Date: Sun, 5 Mar 2023 10:38:54 +0800
Subject: [PATCH 2/3] =?UTF-8?q?Update=20=E5=9B=9E=E6=BA=AF=E7=AE=97?=
 =?UTF-8?q?=E6=B3=95=E5=8E=BB=E9=87=8D=E9=97=AE=E9=A2=98=E7=9A=84=E5=8F=A6?=
 =?UTF-8?q?=E4=B8=80=E7=A7=8D=E5=86=99=E6=B3=95.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/回溯算法去重问题的另一种写法.md b/problems/回溯算法去重问题的另一种写法.md
index 2265a89b..08ba64dc 100644
--- a/problems/回溯算法去重问题的另一种写法.md
+++ b/problems/回溯算法去重问题的另一种写法.md
@@ -561,6 +561,49 @@ impl Solution {
 }
 ```
 
+**40. 组合总和 II**
+
+```rust
+use std::collections::HashSet;
+impl Solution {
+    pub fn backtracking(
+        candidates: &Vec<i32>,
+        target: i32,
+        sum: i32,
+        path: &mut Vec<i32>,
+        res: &mut Vec<Vec<i32>>,
+        start_index: usize,
+    ) {
+        if sum > target {
+            return;
+        }
+        if sum == target {
+            res.push(path.clone());
+        }
+        let mut helper_set = HashSet::new();
+        for i in start_index..candidates.len() {
+            if sum + candidates[i] <= target {
+                if helper_set.contains(&candidates[i]) {
+                    continue;
+                }
+                helper_set.insert(candidates[i]);
+                path.push(candidates[i]);
+                Self::backtracking(candidates, target, sum + candidates[i], path, res, i + 1);
+                path.pop();
+            }
+        }
+    }
+
+    pub fn combination_sum2(mut candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
+        let mut res = vec![];
+        let mut path = vec![];
+        candidates.sort();
+        Self::backtracking(&candidates, target, 0, &mut path, &mut res, 0);
+        res
+    }
+}
+```
+
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>

From 4a203a3787e507cd28016779df9ffbb26e745a8b Mon Sep 17 00:00:00 2001
From: fw_qaq <fwqaaq@gmail.com>
Date: Sun, 5 Mar 2023 11:11:41 +0800
Subject: [PATCH 3/3] =?UTF-8?q?Update=20=E5=9B=9E=E6=BA=AF=E7=AE=97?=
 =?UTF-8?q?=E6=B3=95=E5=8E=BB=E9=87=8D=E9=97=AE=E9=A2=98=E7=9A=84=E5=8F=A6?=
 =?UTF-8?q?=E4=B8=80=E7=A7=8D=E5=86=99=E6=B3=95.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/回溯算法去重问题的另一种写法.md b/problems/回溯算法去重问题的另一种写法.md
index 08ba64dc..e60bd44a 100644
--- a/problems/回溯算法去重问题的另一种写法.md
+++ b/problems/回溯算法去重问题的另一种写法.md
@@ -604,6 +604,44 @@ impl Solution {
 }
 ```
 
+**47. 全排列 II**
+
+```rust
+use std::collections::HashSet;
+impl Solution {
+    pub fn permute_unique(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
+        let mut res = vec![];
+        let mut path = vec![];
+        let mut used = vec![false; nums.len()];
+        Self::backtracking(&mut res, &mut path, &nums, &mut used);
+        res
+    }
+    pub fn backtracking(
+        res: &mut Vec<Vec<i32>>,
+        path: &mut Vec<i32>,
+        nums: &Vec<i32>,
+        used: &mut Vec<bool>,
+    ) {
+        if path.len() == nums.len() {
+            res.push(path.clone());
+            return;
+        }
+        let mut helper_set = HashSet::new();
+        for i in 0..nums.len() {
+            if used[i] || helper_set.contains(&nums[i]) {
+                continue;
+            }
+            helper_set.insert(nums[i]);
+            path.push(nums[i]);
+            used[i] = true;
+            Self::backtracking(res, path, nums, used);
+            used[i] = false;
+            path.pop();
+        }
+    }
+}
+```
+
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>