给定一个二叉树和一个目标和,找到所有从根节点到叶子节点路径总和等于给定目标和的路径。
说明: 叶子节点是指没有子节点的节点。
示例:
给定如下二叉树,以及目标和 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 {
vector<vector<int>> ans;
vector<int> temp;
public:
vector<vector<int>> pathSum(TreeNode* root, int sum) {
if(root==NULL) return ans;
helper(root,sum, root->val);
return ans;
}
void helper(TreeNode* root, int sum, int s)
{
if(root==NULL) return;
sum -= root->val;
temp.push_back(root->val);
if(root->left == NULL && root->right == NULL)
{
if(sum == 0)
{
ans.push_back(temp);
temp.clear();
temp.push_back(s);
}else if(sum < 0)
{
temp.pop_back();
return;
}
}
if(root->left) helper(root->left,sum,s);
if(root->right) helper(root->right,sum,s);
return;
}
};
大佬正确代码:
/**
* 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<int> v;
vector<vector<int>> vv;
DFS(vv,v,root,sum);
return vv;
}
void DFS(vector<vector<int>> &vv,vector<int> v,TreeNode* root,int sum){
if(!root)
return;
sum = sum-root->val;
v.push_back(root->val);
if(!sum && !root->left && !root->right)
vv.push_back(v);
DFS(vv,v,root->left,sum);
DFS(vv,v,root->right,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 {
vector<vector<int>> ans;
vector<int> temp;
public:
vector<vector<int>> pathSum(TreeNode* root, int sum) {
if(root==NULL) return ans;
helper(root,sum);
return ans;
}
void helper(TreeNode* root, int sum)
{
if(root==NULL) return;
sum -= root->val;
temp.push_back(root->val);
if(root->left == NULL && root->right == NULL)
{
if(sum == 0)
{
ans.push_back(temp);
}
}
if(root->left) helper(root->left,sum);
if(root->right) helper(root->right,sum);
temp.pop_back(); //回溯
return;
}
};
总结:
此题是需要回溯的,回溯要放在递归之后 !