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] ]
Code:
/**
* 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> member;
findSum(root, sum,member, res);
return res;
}
void findSum(TreeNode *root, int sum, vector<int> member, vector<vector<int>> &res){
if(!root) return;
member.push_back(root->val);
if(root->val == sum){
if(!root->left && !root->right){
res.push_back(member);
return;
}
}
findSum(root->left, sum - root->val, member, res);
findSum(root->right, sum - root->val, member, res);
}
};