add 90

Author: luliyucoordinate

README.md

@@ -44,6 +44,7 @@ LeetCode
 |0083|[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | c | [c++](./src/0083-Remove-Duplicates-from-Sorted-List/0083.cpp) |[python](./src/0083-Remove-Duplicates-from-Sorted-List/0083.py)|||Easy|
 |0086|[Partition List](https://leetcode.com/problems/partition-list/) | c | [c++](./src/0086-Partition-List/0086.cpp) |[python](./src/0086-Partition-List/0086.py)|||Medium|
 |0088|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | c | [c++](./src/0088-Merge-Sorted-Array/0088.cpp) |[python](./src/0088-Merge-Sorted-Array/0088.py)|||Easy|
+|0090|[Subsets II](https://leetcode.com/problems/subsets-ii/) | c | [c++](./src/0090-Subsets-II/0090.cpp) |[python](./src/0090-Subsets-II/0090.py)|||Medium|
 |0092|[Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/) | c | [c++](./src/0092-Reverse-Linked-List-II/0092.cpp) |[python](./src/0092-Reverse-Linked-List-II/0092.py)|||Medium|
 |0093|[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/) | c | [c++](./src/0093-Restore-IP-Addresses/0093.cpp) |[python](./src/0093-Restore-IP-Addresses/0093.py)|||Medium|
 |0094|[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | c | [c++](./src/0094-Binary-Tree-Inorder-Traversal/0094.cpp) |[python](./src/0094-Binary-Tree-Inorder-Traversal/0094.py)|||Medium|

src/0090-Subsets-II/0090.cpp

@@ -0,0 +1,31 @@
+#include <iostream>
+#include <string>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+static int x = []() {std::ios::sync_with_stdio(false); cin.tie(0); return 0; }();
+class Solution 
+{
+public:
+    vector<vector<int>> subsetsWithDup(vector<int>& nums) 
+    {
+        sort(nums.begin(), nums.end());
+        vector<vector<int>> result;
+        vector<int> path;
+        _subsetsWithDup(nums, 0, path, result);
+        return result;
+    }
+private:
+    void _subsetsWithDup(vector<int>& nums, int index, vector<int>& path, vector<vector<int>>& result) 
+    {
+        result.push_back(path);
+        for (int i = index; i < nums.size(); ++i)
+        {
+            if (index < i and nums[i] == nums[i - 1]) continue;
+            path.push_back(nums[i]);
+            _subsetsWithDup(nums, i + 1, path, result);
+            path.pop_back();
+        }
+    }
+};

src/0090-Subsets-II/0090.py

@@ -0,0 +1,21 @@
+class Solution:
+    def subsetsWithDup(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: List[List[int]]
+        """
+        nums.sort()
+        result = list()
+        self._subsetsWithDup(nums, 0, list(), result)
+        return result
+    
+    def _subsetsWithDup(self, nums, index, path, result):
+        result.append(path.copy())
+        for i in range(index, len(nums)):
+            if index < i and nums[i] == nums[i - 1]:# add
+                continue
+            self._subsetsWithDup(nums, i + 1, path + [nums[i]], result)
+
+if __name__ == '__main__':
+    nums = [1, 2, 2]
+    print(Solution().subsetsWithDup(nums))