FilesExpand file tree

 master

/

PathSum.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

30 lines (27 loc) · 837 Bytes

 master

/

PathSum.java

Top

File metadata and controls

• Code
• Blame

30 lines (27 loc) · 837 Bytes

Raw

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

/**

* 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.

*

* For example:

* Given the below binary tree and sum = 22,

* 5

* / \

* 4 8

* / / \

* 11 13 4

* / \ \

* 7 2 1

* return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

*/

public class PathSum {

public boolean hasPathSum(TreeNode root, int sum) {

if (root == null)

return false;

if (root.left == null && root.right == null && root.val == sum)

return true;

boolean l = root.left != null ? hasPathSum(root.left, sum - root.val)

: false;

boolean r = root.right != null ? hasPathSum(root.right, sum - root.val)

: false;

return l || r;

}

}