利用dfs以及递归
深入到根结点,并将路径上的结点值全部加上在最后进行判断
值得注意的是,每一次是在最后递归的时候才将root当前值加上去,因此在根结点处判断时,需要将根结点的值加上去再进行判断
AC代码
/**
* 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 hasPathSum(TreeNode* root, int targetSum) {
if(root == nullptr)
return false;
return dfs(root, targetSum, 0);
}
bool dfs(TreeNode* root, int targetSum, int sum){
if(!root)
return false;
if(!root->left && !root->right && sum + root->val == targetSum)
return true;
return dfs(root->left, targetSum, sum + root->val) || dfs(root->right, targetSum, sum + root->val);
}
};