refactor 491

fishercoder1534 · fishercoder1534 · commit d777bf10fa13 · 2020-07-14T06:43:19.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_491.java b/src/main/java/com/fishercoder/solutions/_491.java
@@ -5,21 +5,6 @@
 import java.util.List;
 import java.util.Set;
 
-/**
- * 491. Increasing Subsequences
- *
- * Given an integer array, your task is to find all the different possible increasing subsequences of the given array,
- * and the length of an increasing subsequence should be at least 2 .
-
- Example:
- Input: [4, 6, 7, 7]
- Output: [[4, 6], [4, 7], [4, 6, 7], [4, 6, 7, 7], [6, 7], [6, 7, 7], [7,7], [4,7,7]]
-
- Note:
- The length of the given array will not exceed 15.
- The range of integer in the given array is [-100,100].
- The given array may contain duplicates, and two equal integers should also be considered as a special case of increasing sequence.
- */
 public class _491 {
 
     public static class Solution1 {
@@ -33,7 +18,7 @@ public List<List<Integer>> findSubsequences(int[] nums) {
         }
 
         private Set<List<Integer>> backtracking(int[] nums, int start, List<Integer> currList,
-            Set<List<Integer>> answer) {
+                                                Set<List<Integer>> answer) {
             if (currList.size() >= 2) {
                 answer.add(new ArrayList<>(currList));
             }
