-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPathSum.cpp
More file actions
39 lines (35 loc) · 998 Bytes
/
PathSum.cpp
File metadata and controls
39 lines (35 loc) · 998 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
36
37
38
/**
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.
*/
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool hasPathSumUtil(TreeNode* root, int sum) {
if (!root) return false;
if (root->val == sum && !root->left && !root->right) return true;
return (hasPathSumUtil(root->left, sum - root->val) ||
hasPathSumUtil(root->right, sum - root->val));
}
bool hasPathSum(TreeNode *root, int sum) {
return hasPathSumUtil(root, sum);
}
};