给定一个二叉树和一个目标和,找到所有从根节点到叶子节点路径总和等于给定目标和的路径。
说明: 叶子节点是指没有子节点的节点。
示例:
给定如下二叉树,以及目标和 sum = 22,
5
/ \
4 8
/ / \
11 13 4
/ \ / \
7 2 5 1
返回:
[
[5,4,11,2],
[5,8,4,5]
]
/**
* 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:
vector<vector<int>> pathSum(TreeNode* root, int sum) {
vector<vector<int>> ans;
vector<int> stack;
if(root)
dfs(root, sum, ans, stack);
return ans;
}
void dfs(TreeNode* root, int sum, vector<vector<int>>& ans, vector<int>& stack){
stack.push_back(root->val);
if(!root->left&&!root->right&&root->val==sum){
ans.push_back(stack);
stack.pop_back();
return;
}
int new_sum = sum - root->val;
if(root->left)
dfs(root->left, new_sum, ans, stack);
if(root->right)
dfs(root->right, new_sum, ans, stack);
stack.pop_back();
}
};