一、递归
/**
* 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 Path(TreeNode* node, int sum, int targetSum){
if(!node) return false;
if(!node->left && !node->right){
return sum + node->val == targetSum;
}
return Path(node->left, sum + node->val, targetSum) || Path(node->right, sum + node->val, targetSum);
}
bool hasPathSum(TreeNode* root, int targetSum) {
if(!root) return false;
return Path(root, 0, targetSum);
}
};