第六周：[Leetcode]437. Path Sum III

最新推荐文章于 2020-06-25 09:59:50 发布

line02

最新推荐文章于 2020-06-25 09:59:50 发布

阅读量175

点赞数

分类专栏：算法文章标签： leetcode

本文链接：https://blog.csdn.net/line02/article/details/68939795

版权

算法专栏收录该内容

45 篇文章 0 订阅

订阅专栏

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).
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

由于符合条件的路径不一定从根开始，可以从任意的节点开始，所以可以将树的每一个节点视为根来进行DFS，搜索符合条件的路径。

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* p,int sum){
        if(p == NULL)
            return 0;
        sum -= p -> val;
        return (sum == 0) + dfs(p -> left, sum) + dfs(p -> right, sum);
    }
};