给出二叉树的根节点 root 和一个整数目标和 targetSum ,找出所有从根节点到叶子节点 路径总和等于给定目标和的路径。叶子节点是指没有子节点的节点。
class Solution {
public:
std::vector<std::vector<int>> pathSum(TreeNode* root, int sum) {
std::vector<std::vector<int>> res;
std::vector<int> path;
recur(root, sum, res, path);
return res;
}
void recur(TreeNode* root, int tar, std::vector<std::vector<int>>& res, std::vector<int>& path) {
if (!root) return;
path.push_back(root->val);
tar -= root->val;
if (tar == 0 && !root->left && !root->right) {
res.push_back(path);
}
recur(root->left, tar, res, path);
recur(root->right, tar, res, path);
path.pop_back();
}
};