题解
一、暴力深搜
访问每一个节点 用该节点作为第一个节点 向下深搜
/**
* 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:
int DFS(TreeNode* root, int targetSum) {
if (!root) return 0;
int res = 0;
if (root->val == targetSum) res++;
res += DFS(root->left, targetSum - root->val);
res += DFS(root->right, targetSum - root->val);
return res;
}
int pathSum(TreeNode* root, int targetSum) {
if (!root) return 0;
int res = 0;
res += DFS(root, targetSum);
res += pathSum(root->left, targetSum);
res += pathSum(root->right, targetSum);
return res;
}
};