90

Author: ProHiryu

BFS/90.md

@@ -0,0 +1,36 @@
+## [90] Subsets II
+
+#### Description
+
+[link](https://leetcode.com/problems/subsets-ii/)
+
+---
+
+#### Solution BFS
+
+- See Code
+
+---
+
+#### Code
+
+> Complexity  T : O(n^2)   M : O(n^2)
+
+```python
+class Solution:
+    def subsetsWithDup(self, nums: List[int]) -> List[List[int]]:
+        res = [[]]
+        nums.sort()
+        for i in range(len(nums)):
+            if i > 0 and nums[i] == nums[i - 1]:
+                new_res_ = []
+                for sub in new_res:
+                    new_res_.append(sub + [nums[i]])
+                new_res = new_res_
+            else:
+                new_res = []
+                for sub in res:
+                    new_res.append(sub + [nums[i]])
+            res += new_res
+        return res
+```