edit 90

fishercoder1534 · fishercoder1534 · commit 86926c86e5fa · 2017-07-24T18:38:53.000-07:00
diff --git a/README.md b/README.md
@@ -473,6 +473,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |93|[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_93.java)| O(1)|O(1) | Medium | Backtracking
 |92|[Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_92.java)| O(n)|O(1) | Medium
 |91|[Decode Ways](https://leetcode.com/problems/decode-ways/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_91.java)| O(n)|O(n) | Medium| DP
+|90|[Subsets II](https://leetcode.com/problems/subsets-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_90.java)|O(n^2) |O(1)|Medium|Backtracking
 |89|[Gray Code](https://leetcode.com/problems/gray-code/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_89.java)|O(n) |O(1)|Medium|Bit Manipulation
 |88|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_88.java)|O(max(m,n)) |O(1)|Easy|
 |87|[Scramble String](https://leetcode.com/problems/scramble-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_87.java)|O(?) |O(?)|Hard| Recursion
diff --git a/src/main/java/com/fishercoder/solutions/_90.java b/src/main/java/com/fishercoder/solutions/_90.java
@@ -4,7 +4,9 @@
 
 import java.util.*;
 
-/** Given a collection of integers that might contain duplicates, nums, return all possible subsets.
+/**90. Subsets II
+ *
+ *  Given a collection of integers that might contain duplicates, nums, return all possible subsets.
 
  Note: The solution set must not contain duplicate subsets.
 
@@ -20,7 +22,7 @@
  []
  ]
  */
-public class SubsetsII {
+public class _90 {
 
     public static List<List<Integer>> subsetsWithDup(int[] nums) {
         List<List<Integer>> result = new ArrayList();
