输入一棵二叉树和一个整数,打印出二叉树中节点值的和为输入整数的所有路径。从树的根节点开始往下一直到叶节点所经过的节点形成一条路径。
示例:
给定如下二叉树,以及目标和 sum = 22
,
5
/ \
4 8
/ / \
11 13 4
/ \ / \
7 2 5 1
返回:
[
[5,4,11,2],
[5,8,4,5]
]
提示:
节点总数 <= 10000
注意:本题与主站 113 题相同:https://leetcode-cn.com/problems/path-sum-ii/
题目链接:https://leetcode-cn.com/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/
思路
递归思路:
向下记录当前sum、当前路径的情况、所有满足条件路径的记录空间,当到达叶子节点时,判断是否要记录路径。
/**
* 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 {
public:
void road(TreeNode* root, int sum, vector<vector<int>> &res, vector<int> &cur){
sum -= root->val;
cur.push_back(root->val);
if(!root->left && !root->right){
if(sum==0){
res.push_back(cur);
}
}else{
if(root->left) road(root->left, sum, res, cur);
if(root->right) road(root->right, sum, res, cur);
}
cur.pop_back();
}
vector<vector<int>> pathSum(TreeNode* root, int sum) {
vector<vector<int>> res;
if (!root) return res;
vector<int> tmp;
road(root, sum, res, tmp);
return res;
}
};