-
Notifications
You must be signed in to change notification settings - Fork 0
/
112. Path Sum.js
67 lines (61 loc) · 983 Bytes
/
112. Path Sum.js
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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
/* https://leetcode.com/problems/path-sum/ */
/**
* Definition for a binary tree node.
* function TreeNode(val) {
* this.val = val;
* this.left = this.right = null;
* }
*/
/**
* @param {TreeNode} root
* @param {number} sum
* @return {boolean}
*/
var hasPathSum = function(root, sum, currentSum = 0) {
if (!root) {
return false;
}
currentSum += root.val;
if (root.left || root.right) {
return !!(
(root.left && hasPathSum(root.left, sum, currentSum)) ||
(root.right && hasPathSum(root.right, sum, currentSum))
);
} else {
return currentSum === sum;
}
};
let s = {
val: 1,
left: {
val: 2
}
};
// let s1 = {
// val: 5,
// left: {
// val: 4,
// left: {
// val: 11,
// left: {
// val: 7
// },
// right: {
// val: 2
// }
// }
// },
// right: {
// val: 8,
// left: {
// val: 13
// },
// right: {
// val: 4,
// right: {
// val: 1
// }
// }
// }
// };
console.log(hasPathSum(s, 0));