LeetCode-437. Path Sum III

最新推荐文章于 2024-10-08 10:36:00 发布

R_zz

最新推荐文章于 2024-10-08 10:36:00 发布

阅读量178

点赞数

分类专栏： LeetCode-Tree 文章标签： path each leetcode tree

本文链接：https://blog.csdn.net/u011409644/article/details/59110786

版权

LeetCode-Tree 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

问题：
https://leetcode.com/problems/path-sum-iii/?tab=Description
You are given a binary tree in which each node contains an integer value.
Find the number of paths that sum to a given value.
The path does not need to start or end at the root or a leaf, but it must go downwards (traveling only from parent nodes to child nodes).
找出所有路径，这个路径的和等于sum，只允许从父节点到子节点的路线
The tree has no more than 1,000 nodes and the values are in the range -1,000,000 to 1,000,000.
Example: root = [10,5,-3,3,2,null,11,3,-2,null,1], sum = 8
10
/ \
5 -3
/ \ \
3 2 11
/ \ \
3 -2 1
Return 3. The paths that sum to 8 are: 1. 5 -> 3 2. 5 -> 2 -> 1 3. -3 -> 11
分析：
以每一个节点作为路径根节点进行前序遍历，查找每一条路径的权值和与sum是否相等
参考C++代码：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int pathSum(TreeNode* root, int sum) {
        if(root==NULL) return 0;
        return dfs(root,sum)+pathSum(root->left,sum)+pathSum(root->right,sum);
    }
    int dfs(TreeNode* root,int sum){
        int res=0;
        if(root==NULL) return res;
        if(sum==root->val) res++;
        res+=dfs(root->left,sum-root->val);
        res+=dfs(root->right,sum-root->val);
        return res;
    }
};