LeetCode 113. Path Sum II

最新推荐文章于 2020-07-15 10:36:06 发布

原创最新推荐文章于 2020-07-15 10:36:06 发布 · 155 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 题解 C++版专栏收录该内容

138 篇文章

订阅专栏

本文详细解析了LeetCode上的PathSum II题目，该题目要求在给定的二叉树中找到所有从根节点到叶子节点的路径，且路径上各节点值之和等于给定的总和。通过深度优先搜索(DFS)算法实现解决方案，递归遍历树的每个节点，并跟踪当前路径的节点值。当到达叶子节点且路径和等于给定和时，将路径添加到结果集中。

Path Sum II - LeetCode

Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.

Note: A leaf is a node with no children.

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]
]

class Solution {
public:
    vector<vector<int>> res;
    vector<int> onePath;
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        dfs(root, sum);
        return res;
    }
    void dfs(TreeNode* root, int sum) {
        if (!root) return ;
        onePath.push_back(root->val);
        if (!root->left && !root->right && sum==root->val)
            res.push_back(onePath);
        dfs(root->left, sum - root->val);
        dfs(root->right, sum - root->val);
        onePath.pop_back();
    }
};