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

Appearance settings

Latest commit

 

History

History
History
33 lines (32 loc) · 1.05 KB

File metadata and controls

33 lines (32 loc) · 1.05 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public List<List<Integer>> result = new ArrayList<List<Integer>>();
public List<List<Integer>> pathSum(TreeNode root, int sum) {
List<Integer> curr = new ArrayList<Integer>();
this.dfs(curr, root, sum);
return this.result;
}
public void dfs(List<Integer> curr, TreeNode root, int sum) {
if (root == null) {
return;
} else if (root.val == sum && root.left == null && root.right == null) {
curr.add(root.val);
this.result.add(curr);
return;
} else {
List<Integer> copy_left = new ArrayList<Integer>(curr);
copy_left.add(root.val);
List<Integer> copy_right = new ArrayList<Integer>(copy_left);
this.dfs(copy_left, root.left, sum-root.val);
this.dfs(copy_right, root.right, sum-root.val);
}
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.