题目描述
给定一个二叉树和一个值\ sum sum,请找出所有的根节点到叶子节点的节点值之和等于\ sum sum 的路径,
例如:
给出如下的二叉树,\ sum=22 sum=22,
返回
[
[5,4,11,2],
[5,8,9]
]
示例1
输入
{1,2},1
返回值
[]
示例2
输入
{1,2},3
返回值
[[1,2]]
/**
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
class Solution {
public:
/**
*
* @param root TreeNode类
* @param sum int整型
* @return int整型vector<vector<>>
*/
vector<vector<int> > pathSum(TreeNode* root, int sum) {
// write code here
vector<vector<int>> res;
vector<int> cur;
dfs(root, sum, cur, res);
return res;
}
void dfs(TreeNode* root, int sum, vector<int> &cur, vector<vector<int>>& res){
if(root == NULL)
return;
sum -= root->val;
cur.push_back(root->val);
if(sum == 0 && root->left == NULL && root->right == NULL){
res.push_back(cur);
}else{
dfs(root->left, sum, cur, res);
dfs(root->right, sum, cur, res);
}
cur.pop_back();
}
};