class Solution {
public:
vector<vector<int> > result;
void compare(vector<int>& path,TreeNode *root,int expectNumber,int sum)
{
sum += root->val;
if(sum == expectNumber && root->left == NULL && root->right == NULL)
{
result.push_back(path);
return ;
}
if(root->left)
{
path.push_back(root->left->val);
compare(path,root->left,expectNumber,sum);
path.pop_back();
}
if(root->right)
{
path.push_back(root->right->val);
compare(path,root->right,expectNumber,sum);
path.pop_back();
}
}
vector<vector<int> > FindPath(TreeNode* root,int expectNumber) {
if(root == NULL)
{
return result;
}
vector<int> path;
path.push_back(root->val);
compare(path,root,expectNumber,0);
return result;
}
};