Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.
For example:Given the below binary tree and
sum = 22
,
5 / \ 4 8 / / \ 11 13 4 / \ / \ 7 2 5 1
return
[ [5,4,11,2], [5,8,4,5] ]
啊采用DFS方法,每次到达叶子节点返回,并且恢复原来的值!
代码如下:
class Solution {
public:
vector<vector<int>> pathSumVector;
int depthSum1;
vector<vector<int>> pathSum(TreeNode* root, int sum)
{
depthSum1=0;
if (root==NULL)
{
return pathSumVector;
}
vector<int> solution;
DFS_sum(root,sum,solution);
return pathSumVector;
}
void DFS_sum(TreeNode* root, int sum, vector<int> &solution)
{
if (root)
{
if (root->left==NULL&&root->right==NULL)
{
if (depthSum1+root->val==sum)
{
solution.push_back(root->val);
pathSumVector.push_back(solution);
solution.pop_back();
}
return;
}
depthSum1+=root->val;
solution.push_back(root->val);
DFS_sum(root->left,sum,solution);
DFS_sum(root->right,sum,solution);
depthSum1-=root->val;
solution.pop_back();
}
}
};