forked from DengWangBao/Leetcode-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPathSumII.java
29 lines (23 loc) · 818 Bytes
/
PathSumII.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
public class PathSumII {
public List<List<Integer>> pathSum(TreeNode root, int sum) {
List<List<Integer>> result = new LinkedList<>();
helper(root, sum, result, new LinkedList<>());
return result;
}
private void helper(TreeNode node, int sum, List<List<Integer>> result, List<Integer> list) {
if (node == null) {
return;
}
list.add(node.val);
if (node.left == null && node.right == null && sum == node.val) {
result.add(new ArrayList<>(list));
} else {
helper(node.left, sum - node.val, result, list);
helper(node.right, sum - node.val, result, list);
}
list.remove(list.size() - 1);
}
}