mirror of
https://github.com/arkorty/LeetCode.git
synced 2026-03-17 16:51:46 +00:00
Initial commit
This commit is contained in:
23
Easy/path-sum/solution.cpp
Normal file
23
Easy/path-sum/solution.cpp
Normal file
@@ -0,0 +1,23 @@
|
||||
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 hasPathSum(TreeNode *root, int targetSum) {
|
||||
if (root == nullptr) {
|
||||
return false;
|
||||
} else if (root->left == nullptr && root->right == nullptr) {
|
||||
return targetSum == root->val;
|
||||
} else {
|
||||
return hasPathSum(root->left, targetSum - root->val) ||
|
||||
hasPathSum(root->right, targetSum - root->val);
|
||||
}
|
||||
}
|
||||
};
|
||||
Reference in New Issue
Block a user