题目描述
思路分析
二叉树+DFS
代码实现
/**
* 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 res;
bool hasPathSum(TreeNode* root, int targetSum) {
res=false;
if(!root) return false;
dfs(root,root->val,targetSum);
return res;
}
void dfs(TreeNode* root,int s,int targetSum){
if(!root->left&&!root->right){
if(s==targetSum) res=true;
return;
}
if(root->left) dfs(root->left,s+root->left->val,targetSum);
if(root->right) dfs(root->right,s+root->right->val,targetSum);
}
};