update

Author: yuanguangxin

src/回溯法/q40_组合总和2/Solution.java

@@ -30,9 +30,7 @@ public void helper(int[] candidates, int target, int start, LinkedList<Integer>
             if (!set.contains(candidates[i]) && target >= candidates[i]) {
                 stack.push(candidates[i]);
                 helper(candidates, target - candidates[i], i + 1, stack, res);
-                System.out.println(stack + "before");
                 stack.pop();
-                System.out.println(stack + "after");
                 set.add(candidates[i]);
             }
         }