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
/**
* 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>> res;
vector<int> path;
vector<vector<int>> pathSum(TreeNode* root, int sum) {
if (root == NULL) return res;
res.clear();
path.clear();
int currentSum = 0;
dfs(root , sum , path , currentSum);
return res;
}
void dfs(TreeNode* root , int sum , vector<int> & path , int currentsum) {
currentsum += root->val;
path.push_back(root->val);
bool isleaf = root->left == NULL && root->right == NULL;
if (isleaf && currentsum == sum) res.push_back(path);
if (root->left != NULL) dfs(root->left,sum,path,currentsum);
if (root->right != NULL) dfs(root->right , sum , path , currentsum);
path.pop_back();
}
};