二叉树路径总和问题

最新推荐文章于 2024-09-14 22:25:23 发布

HuiHai_

最新推荐文章于 2024-09-14 22:25:23 发布

阅读量342

点赞数 6

文章标签：深度优先算法

本文链接：https://blog.csdn.net/weixin_53287225/article/details/135277981

版权

LeetCode112 路径总和

LeetCode113 路径总和II

LeetCode437 路径总和III

LeetCode112 路径总和

/**
 * 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:
    int sum=0;
    bool flag=false;
    void dfs(TreeNode* root, int targetSum){
        if(root==NULL) return;
        sum+=root->val;
        if(root->left==NULL&&root->right==NULL&&sum==targetSum){
            flag=true;
            return;
        }
        dfs(root->left,targetSum);
        dfs(root->right,targetSum);
        sum-=root->val;
    }
    bool hasPathSum(TreeNode* root, int targetSum) {
       dfs(root,targetSum);
       return flag; 
    }
};

LeetCode113 路径总和II

/**
 * 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>> res;
    vector<int>list;
    int sum=0;
    void dfs(TreeNode* root, int targetSum){
        if(root==NULL) return;
        list.push_back(root->val);
        sum+=root->val;
        if(root->left==NULL&&root->right==NULL&&sum==targetSum){
            res.push_back(list);
        }
        dfs(root->left,targetSum);
        dfs(root->right,targetSum);
        sum-=root->val;
        list.pop_back();
    }
    vector<vector<int>> pathSum(TreeNode* root, int targetSum) {
        dfs(root,targetSum);
        return res;
    }
};

LeetCode437 路径总和III

/**
 * 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:
    long long sum=0;
    int res=0;
    void dfs(TreeNode* root,int targetSum){
        if(root==NULL) return;
        sum+=root->val;
        if(sum==targetSum){
            res++;
        }
        dfs(root->left,targetSum);
        dfs(root->right,targetSum);
        sum-=root->val;
    }
    void Search(TreeNode* root,int targetSum){
        if(root!=NULL){
            dfs(root,targetSum);
            Search(root->left,targetSum);
            Search(root->right,targetSum);
        }
    }
    int pathSum(TreeNode* root, int targetSum) {
        Search(root,targetSum);
        return res;
    }
};