Leetcode 112/113 路径总和（二叉树从根到叶子之和等于target，存在性以及方案数）

最新推荐文章于 2024-04-11 22:24:17 发布

wwxy261

最新推荐文章于 2024-04-11 22:24:17 发布

阅读量287

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/wwxy1995/article/details/116681740

版权

算法专栏收录该内容

3633 篇文章 120 订阅

订阅专栏

必须要到叶子节点，代码

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    bool hasPathSum(TreeNode* root, int targetSum) {
        if(root == nullptr){
            return false;
        }
        if(root-> val == targetSum && root->left == nullptr && root->right == nullptr){
            return true;
        }
        if(root->left && hasPathSum(root->left, targetSum - root->val)){
            return true;
        }
        if(root->right && hasPathSum(root->right, targetSum - root->val)){
            return true;
        }
        return false;
    }
};

这是典型的回溯输出方案数，由于必须从根节点到叶子节点，所以每次先减去当前val，push，然后搜素回溯

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> pathSum(TreeNode* root, int targetSum) {
        dfs(root, targetSum);
        return res;
    }

    vector<vector<int>> res;
    vector<int> path;

    void dfs(TreeNode* root, int targetSum){
        if(root == nullptr){
            return;
        }
        path.push_back(root->val);
        targetSum -= root->val;
        if(targetSum == 0 && root->left == nullptr && root->right == nullptr){
            res.push_back(path);
        }
        dfs(root->left, targetSum);
        dfs(root->right,targetSum);
        path.pop_back();
    }
};