题目:
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] ]
解题思路:用递归算法,使path表示递归过程中的路径,使paths存放满足条件的路,在写一个递归函数来遍历树找到满足条件的路径。递归函数结束条件有两个:一个当现在的跟为空时;一个是当现在的跟是叶节点且满足条件时,这时就得到一个解,把这个解存放在paths中。这个题中要注意path中值的加入和删除。
代码:
/**
* 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> > paths;
vector<int> path;
findPaths(root, sum, path, paths);
return paths;
}
private:
void findPaths(TreeNode* root1, int sum, vector<int>& path, vector<vector<int> >& paths) {
if (!root1) return;
path.push_back(root1 -> val);
if (!(root1 -> left) && !(root1 -> right) && sum == root1 -> val)
paths.push_back(path);
findPaths(root1 -> left, sum - root1 -> val, path, paths);
findPaths(root1 -> right, sum - root1 -> val, path, paths);
path.pop_back();
}
};