力扣------路径总和 III

最新推荐文章于 2022-07-29 14:24:09 发布

qq_37760746

最新推荐文章于 2022-07-29 14:24:09 发布

阅读量115

点赞数

分类专栏： C/C++ 文章标签： leetcode 深度优先算法

本文链接：https://blog.csdn.net/qq_37760746/article/details/125633926

版权

C/C++ 专栏收录该内容

114 篇文章 0 订阅

订阅专栏

在这里插入图片描述

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
int count;
void sum(struct TreeNode* root, int targetSum,long int nowsum){
    if(nowsum==targetSum){
        count++;
    }
    if(root->left){
        nowsum=nowsum+root->left->val;
        sum(root->left,targetSum,nowsum);
        nowsum=nowsum-root->left->val;
    }
    if(root->right){
        nowsum=nowsum+root->right->val;
        sum(root->right,targetSum,nowsum);
        nowsum=nowsum-root->right->val;       
    }
}
void dfs(struct TreeNode* root, int targetSum){
    long int nowsum=0;
    nowsum=nowsum+root->val;
    sum(root, targetSum,nowsum);
    if(root->left){
        dfs(root->left,targetSum);
    }
    if(root->right){
        dfs(root->right,targetSum);
    }
}
int pathSum(struct TreeNode* root, int targetSum){
    count=0;
    if(!root){
        return count;
    }
    dfs(root,targetSum);
    return count;
}