refactor 90

fishercoder1534 · fishercoder1534 · commit 76e671088c00 · 2018-03-02T15:39:55.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_90.java b/src/main/java/com/fishercoder/solutions/_90.java
@@ -6,7 +6,8 @@
 import java.util.List;
 import java.util.Set;
 
-/**90. Subsets II
+/**
+ * 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.
@@ -49,7 +50,7 @@ public static List<List<Integer>> subsetsWithDup(int[] nums) {
             return result;
         }
     }
-    
+
     public static class Solution2 {
         public List<List<Integer>> subsetsWithDup(int[] nums) {
             List<List<Integer>> result = new ArrayList();

Original file line number	Diff line number	Diff line change
`@@ -6,7 +6,8 @@`
`6`	`6`	`import java.util.List;`
`7`	`7`	`import java.util.Set;`
`8`	`8`
`9`		`-/**90. Subsets II`
	`9`	`+/**`
	`10`	`+ * 90. Subsets II`
`10`	`11`	`*`
`11`	`12`	`*Given a collection of integers that might contain duplicates, nums, return all possible subsets.`
`12`	`13`	`Note: The solution set must not contain duplicate subsets.`
`@@ -49,7 +50,7 @@ public static List<List<Integer>> subsetsWithDup(int[] nums) {`
`49`	`50`	`return result;`
`50`	`51`	`}`
`51`	`52`	`}`
`52`		`-`
	`53`	`+`
`53`	`54`	`public static class Solution2 {`
`54`	`55`	`public List<List<Integer>> subsetsWithDup(int[] nums) {`
`55`	`56`	`List<List<Integer>> result = new ArrayList();`