题目:输入一棵二叉树和一个整数,打印出二叉树中节点值的和为输入整数的所有路径。从树的根节点开始往下一直到叶节点所经过的节点形成一条路径。
如图,输入上图的二叉树和整数 22,则打印出两条路径,第一条路径:10, 12; 第二条路径为:10, 5, 7.
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution{
vector<vector<int> > res;
void helper(TreeNode *root,int left,vector<int> &base){
if(!root->left&&!root->right){
if(root->val==left){
base.push_back(root->val);
res.push_back(base);
base.pop_back();
}
return ;
}
if(root->left){
base.push_back(root->val);
helper(root->left, left-root->val,base);
base.pop_back();
}
if(root->right){
base.push_back(root->val);
helper(root->right,left-root->val,base);
base.pop_back();
}
}
public:
vector<vector<int>> pathSum(TreeNode* root, int sum) {
if(!root)
return res;
vector<int> base;
helper(root,sum,base);
return res;
}
};