-
Notifications
You must be signed in to change notification settings - Fork 0
/
437. Path Sum III.java
39 lines (39 loc) · 1.03 KB
/
437. Path Sum III.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
/**
* 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 int pathSum(TreeNode root, int sum) {
int count = 0;
if(root == null)
return 0;
count += pathSum(root.left, sum);
count += pathSum(root.right, sum);
count += getCount(root, sum);
return count;
}
public int getCount(TreeNode root, int sum){
if(root == null)
return 0;
sum = sum - root.val;
int c = 0;
if(sum == 0)
c++;
c += getCount(root.left, sum);
c += getCount(root.right, sum);
return c;
}
}