Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 3ecec23

Browse files
update
1 parent 72fc0f3 commit 3ecec23

File tree

1 file changed

+0
-2
lines changed

1 file changed

+0
-2
lines changed

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

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -30,9 +30,7 @@ public void helper(int[] candidates, int target, int start, LinkedList<Integer>
3030
if (!set.contains(candidates[i]) && target >= candidates[i]) {
3131
stack.push(candidates[i]);
3232
helper(candidates, target - candidates[i], i + 1, stack, res);
33-
System.out.println(stack + "before");
3433
stack.pop();
35-
System.out.println(stack + "after");
3634
set.add(candidates[i]);
3735
}
3836
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /