-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathPathSum.java
More file actions
40 lines (29 loc) · 1.16 KB
/
Copy pathPathSum.java
File metadata and controls
40 lines (29 loc) · 1.16 KB
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
// Given a binary tree and a sum, determine if the tree has a root-to-leaf
// path such that adding up all the values along the path equals the given sum.
// See: https://leetcode.com/problems/path-sum/
package leetcode.tree;
import static leetcode.util.tree.BinTreeUtil.*;
import leetcode.util.tree.TreeNode;
public class PathSum {
public boolean hasPathSum(TreeNode root, int sum) {
if (root == null)
return false;
if (root.left == null && root.right == null) {
return sum - root.val == 0;
}
return hasPathSum(root.left, sum - root.val) ||
hasPathSum(root.right, sum - root.val);
}
public static void main(String[] args) {
PathSum sln = new PathSum();
TreeNode t1 = initTree(5, 4, 8, 11, null, 13, 4, 7, 2, null, 1);
printInorder(t1);
TreeNode t2 = initTree(1, 2);
printInorder(t2);
TreeNode t3 = initTree();
printInorder(t3);
System.out.println(sln.hasPathSum(t1, 22)); // true
System.out.println(sln.hasPathSum(t2, 1)); // false
System.out.println(sln.hasPathSum(t3, 0)); // false
}
}