-
Notifications
You must be signed in to change notification settings - Fork 0
/
SumPath.java
50 lines (43 loc) · 1004 Bytes
/
SumPath.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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
/*
Question: Given a binary tree and a sum,
find all root-to-leaf paths where each path's sum equals the given sum.
sum = 22,
5
/ \
4 8
/ / \
11 13 4
/ \ / \
7 2 5 1
return : {{5,4,11,2},{5,8,4,5}}
*/
public class TreeNode{
int val;
TreeNode left;
TreeNode right;
TreeNode(int x){val = x;}
}
public List<List<Integer>> sumPath(int sum,TreeNode root){
List<List<Ingeter>> res = new ArrayList<>();
if (root == null) return res;
getPath(root,sum,res,new ArrayList<>());
return res;
}
public void getPath(TreeNode root,int sum,List<List<Ingeter>> res,List<Integer> list){
if (root.left == null && root.right == null){
if (root.val == sum){
list.add(root.val);
res.add(new ArrayList<>(list));
list.remove(list.size() - 1)[
}
return;
}
list.add(root.val);
if (root.left != null){
getPath(root.left,sum - root.val,res,list);
}
if (root.right != null){
getPath(root.right,sum - root.val,res,list);
}
list.remove(list.size() - 1);
}