题目链接:
https://leetcode.com/problems/path-sum-ii/description/
描述
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
输出
[
[5,4,11,2],
[5,8,4,5]
]
样例输入
样例输出
算法思想:
扫描二叉树,并记录根节点到当前扫描节点的路径,如果符合要求,将此路径加入到结果路径中
源代码
class Solution {
public:
void findPath(TreeNode* root, int sum, vector<int> &tem, vector<vector<int>> &path)
{
if (root)
tem.push_back(root->val); //如果不为空就加上tem上
if (!root)
return;
if (root->val == sum && !root->left && !root->right)
{
path.push_back(tem);
}
findPath(root->left, sum - root->val, tem, path);
findPath(root->right, sum - root->val, tem, path);
tem.pop_back(); //左右都不符合的 把这个节点从tem中删除
}
vector<vector<int>> pathSum(TreeNode* root, int sum) {
vector<vector<int>> result;
vector<int> tem;
findPath(root, sum, tem, result);
return result;
}
};
最优源代码