-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathOctomber_4.cpp
40 lines (35 loc) · 1.01 KB
/
Octomber_4.cpp
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
// https://leetcode.com/problems/path-sum/description/
// 112. Path Sum
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
bool dfs(TreeNode* root, int targetSum){
// base case
if(root == NULL){
return false;
}
// sub
targetSum -= root->val;
if(root->left == NULL and root->right == NULL){
return targetSum == 0;
}
// check for left and right child
return dfs(root->left,targetSum) || dfs(root->right,targetSum);
}
bool hasPathSum(TreeNode* root, int targetSum) {
if(root == NULL){
return false;
}
return dfs(root,targetSum);
}
};