題目:
分析:
前缀和问题、
代码:
/**
* 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 ans=0;
void f(TreeNode* root,int sum,vector<int> v)
{
if(root==NULL) return ;
if(root->val==sum) ans++;
for(int i=0;i<v.size();i++)
{
v[i]+=root->val;
if(v[i]==sum) ans++;
}
v.push_back(root->val);
f(root->right,sum,v);
f(root->left,sum,v);
}
int pathSum(TreeNode* root, int sum) {
vector<int> v;
f(root,sum,v);
return ans;
}
};