-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhasPathSum.java
More file actions
35 lines (32 loc) · 891 Bytes
/
hasPathSum.java
File metadata and controls
35 lines (32 loc) · 891 Bytes
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
/**
* https://leetcode.com/problems/path-sum/
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public boolean hasPathSum(TreeNode root, int sum) {
if(root == null) return false;
sum -= root.val;
if(sum == 0 && root.left == null && root.right == null){
return true;
}
if(root.left != null) {
if (hasPathSum(root.left, sum)) return true;
}
if(root.right != null){
if(hasPathSum(root.right, sum)) return true;
};
return false;
}
}