Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.
Note: A leaf is a node with no children.
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] ]
* 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>> result;
vector<int> cur;
if(root==NULL)
return result;
DFS(result,cur,root,sum);
return result;
}
void DFS(vector<vector<int>> &result,vector<int> &cur,TreeNode* root,int sum)
{
if(root==NULL)
return;
if(root->left==NULL&&root->right==NULL)
//到达叶子节点,形成合法路径,这时候再对路径进行验证
{
cur.push_back(root->val);
if(sumOfPath(cur)==sum)
result.push_back(cur);
cur.pop_back();
//弹出当前路径末端数据并返回
return;
}
else
{
cur.push_back(root->val);
DFS(result,cur,root->left,sum);
DFS(result,cur,root->right,sum);
cur.pop_back();
//某一根节点的子节点搜索完毕,末端数据弹出,返回上一层
}
}
int sumOfPath(vector<int> &dataSet)//求取路径和
{
int sum=0;
for(int i=0;i<dataSet.size();i++)
{
sum+=dataSet[i];
}
return 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:
vector<vector<int>> pathSum(TreeNode* root, int sum)
{
vector<vector<int> > res;
vector<int> path;
dfs(root, sum, path, res);
return res;
}
void dfs(TreeNode *root, int rest, vector<int> &path,
vector<vector<int> > &res) {
if (root == NULL)
return;
path.push_back(root->val);
rest -= root->val;
if (root->left == NULL && root->right == NULL) {
if (rest == 0)
res.push_back(path);
} else {
if (root->left)
dfs(root->left, rest, path, res);
if (root->right)
dfs(root->right, rest, path, res);
}
path.pop_back();
}
};