剑指 Offer II 050. 向下的路径节点之和

最新推荐文章于 2024-10-08 20:32:22 发布

MOXI33441

最新推荐文章于 2024-10-08 20:32:22 发布

阅读量49

点赞数

分类专栏：算法剑指offer 文章标签：算法 leetcode c++ Powered by 金山文档

本文链接：https://blog.csdn.net/MOXI33441/article/details/129622461

版权

算法同时被 2 个专栏收录

40 篇文章 0 订阅

订阅专栏

剑指offer

22 篇文章 0 订阅

订阅专栏

层序遍历+前序遍历

/**
 * 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_road = 0;
    int pathSum(TreeNode* root, int targetSum) {
        sum_road = 0;
        long long int sum = 0;
        // 递推+递归吧，层序遍历+递归
        if(root==nullptr){
            return 0;
        }
        // 层序遍历
        queue<TreeNode*> q;
        q.push(root);
        while(!q.empty()){
            if(q.front()->left){
                q.push(q.front()->left);
            }
            if(q.front()->right){
                q.push(q.front()->right);
            }
            pathTrue(q.front(),targetSum,sum);
            q.pop();
        }
        return sum_road;
    }
    void pathTrue(TreeNode* root,int targetSum,long long int sum){
        sum+=root->val;
        if(sum ==targetSum){
            sum_road++;
        }
        // 出递归条件，碰到叶子节点
        if(root->left==nullptr&&root->right==nullptr){
            return ;
        }
        if(root->left!=nullptr){
            pathTrue(root->left,targetSum,sum);
        }
        if(root->right!=nullptr){
            pathTrue(root->right,targetSum,sum);
        }
    }
};