二叉树中和为某一值的路径

题目描述

/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
vector<vector<int>> result;
vector<int> temp;
public:
void c(TreeNode* root,int n)
{
temp.push_back(root->val);
if(n==root->val&&root->left==NULL&&root->right==NULL)
result.push_back(temp);
if(root->left)
c(root->left,n-root->val);
if(root->right)
c(root->right,n-root->val);
temp.pop_back();
}
vector<vector<int> > FindPath(TreeNode* root,int expectNumber)
{
if(root)
c(root,expectNumber);
return result;
}
};