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] ]
等这一轮LEETCODE 刷完,下一轮考虑非递归的方法。
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void pathSum(TreeNode *root, int sum, vector<vector<int> > &results, vector<int> current) {
if(root == NULL) return;
if(root->val == sum && root->left == NULL && root->right == NULL) {
current.push_back(root->val);
results.push_back(current);
return;
}
current.push_back(root->val);
pathSum(root->left, sum - root->val, results, current);
pathSum(root->right, sum - root->val, results, current);
}
vector<vector<int> > pathSum(TreeNode *root, int sum) {
vector<vector<int> > results;
vector<int> current;
pathSum(root, sum, results, current);
return results;
}
};