From e8f8e7b8034d0cb27af5634b3bbe207e8d7ee6bf Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E4=B8=80=E6=96=87?=
 <30338551+YiwenXie@users.noreply.github.com>
Date: Wed, 12 May 2021 22:44:41 +0900
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200090.=E5=AD=90=E9=9B=86II.?=
 =?UTF-8?q?md=20Java=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0090.子集II.md b/problems/0090.子集II.md
index cc5fd571..47db79f7 100644
--- a/problems/0090.子集II.md
+++ b/problems/0090.子集II.md
@@ -172,7 +172,40 @@ if (i > startIndex && nums[i] == nums[i - 1] ) {
 
 
 Java：
-
+```java
+class Solution {
+   List<List<Integer>> result = new ArrayList<>();// 存放符合条件结果的集合
+   LinkedList<Integer> path = new LinkedList<>();// 用来存放符合条件结果
+   boolean[] used;
+    public List<List<Integer>> subsetsWithDup(int[] nums) {
+        if (nums.length == 0){
+            result.add(path);
+            return result;
+        }
+        Arrays.sort(nums);
+        used = new boolean[nums.length];
+        subsetsWithDupHelper(nums, 0);
+        return result;
+    }
+    
+    private void subsetsWithDupHelper(int[] nums, int startIndex){
+        result.add(new ArrayList<>(path));
+        if (startIndex >= nums.length){
+            return;
+        }
+        for (int i = startIndex; i < nums.length; i++){
+            if (i > 0 && nums[i] == nums[i - 1] && !used[i - 1]){
+                continue;
+            }
+            path.add(nums[i]);
+            used[i] = true;
+            subsetsWithDupHelper(nums, i + 1);
+            path.removeLast();
+            used[i] = false;
+        }
+    }
+}
+```
 
 Python：