题目:
给定一个二叉树和一个目标和,找到所有从根节点到叶子节点路径总和等于给定目标和的路径。
说明: 叶子节点是指没有子节点的节点。
题目链接:Path Sum II
C++:
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>> pathSum(TreeNode* root, int sum) {
vector<vector<int>> ret;
vector<int> path;
dfs(ret, path, root, sum);
return ret;
}
void dfs(vector<vector<int>>& ret, vector<int> path, TreeNode* root, int sum) {
if(root){
if(!root->left && !root->right){
if(sum == root->val){
path.push_back(root->val);
ret.push_back(path);
path.pop_back();
return;
}
}
else{
path.push_back(root->val);
dfs(ret, path, root->left, sum - root->val);
dfs(ret, path, root->right, sum - root->val);
path.pop_back();
}
}
}
};