refactor 78

fishercoder1534 · fishercoder1534 · commit 8431b9d61091 · 2020-05-05T07:10:30.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_78.java b/src/main/java/com/fishercoder/solutions/_78.java
@@ -3,26 +3,6 @@
 import java.util.ArrayList;
 import java.util.List;
 
-/**
- * 78. Subsets
- *
- * Given a set of distinct integers, nums, return all possible subsets.
- * Note: The solution set must not contain duplicate subsets.
-
- For example,
- If nums = [1,2,3], a solution is:
- [
- [3],
- [1],
- [2],
- [1,2,3],
- [1,3],
- [2,3],
- [1,2],
- []
- ]
- */
-
 public class _78 {
 
     public static class Solution1 {
@@ -47,7 +27,9 @@ public List<List<Integer>> subsets(int[] nums) {
     }
 
     public static class Solution2 {
-        /**This is the most straightforward solution and easy to follow.*/
+        /**
+         * This is the most straightforward solution and easy to follow.
+         */
         public List<List<Integer>> subsets(int[] nums) {
             List<List<Integer>> result = new ArrayList();
             backtracking(result, new ArrayList(), nums, 0);
