题目:
代码:
vector<vector<int>> vv;
void f(TreeNode* r,int c,vector<int> v)
{
v.push_back(r->val);
c=c+r->val;
if(r->right==NULL&&r->left==NULL)
{
if(c==t)
{
vv.push_back(v);
}
}
else if(r->right==NULL&&r->left!=NULL){
f(r->left,c,v);
}
if(r->right!=NULL&&r->left==NULL){
f(r->right,c,v);
}
if(r->right!=NULL&&r->left!=NULL){
f(r->left,c);
f(r->right,c);
}
}
int main()
{
TreeNode* root;
vector<int> v;
if(root==NULL)
{
return vv;
}
t=sum;
f(root,0,v);
return vv;
}