题目描述:
给定一个二叉树和一个目标和,找到所有从根节点到叶子节点路径总和等于给定目标和的路径。
说明: 叶子节点是指没有子节点的节点。
示例:
给定如下二叉树,以及目标和 sum = 22
,
5 / \ 4 8 / / \ 11 13 4 / \ / \ 7 2 5 1
返回:
[ [5,4,11,2], [5,8,4,5] ]
AC C++ Solution:
回溯法:
/* 回溯法 */
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* node, int sum, vector<int>& path, vector<vector<int> >& paths) {
if(!node) return;
path.push_back(node->val);
if(sum == node->val && node->left == NULL && node->right == NULL)
paths.push_back(path);
findPaths(node->left,sum-node->val,path,paths);
findPaths(node->right,sum-node->val,path,paths);
path.pop_back();
}
};