【Leetcode刷题笔记】437. Path Sum III 寻找树的子路径和中等于sum的路径

最新推荐文章于 2021-03-20 21:34:54 发布

乐观的Zqq

最新推荐文章于 2021-03-20 21:34:54 发布

阅读量165

点赞数

分类专栏：【leetcode刷题日记】

本文链接：https://blog.csdn.net/qq_34326845/article/details/87890918

版权

【leetcode刷题日记】专栏收录该内容

40 篇文章 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

分析：题目的意思就是在二叉树的所有子路径中找到和加起来等于目标值的路径并且计数。一个最简单的思路就是，暴力遍历所有子路径，加和然后判断。
1.暴力：简单到极致的代码

int pathSum(TreeNode* root, int sum) {
        return root?get(root,sum)+pathSum(root->left,sum)+pathSum(root->right,sum):0;
    }
    int get(TreeNode* root,int sum){
        return root?(sum==root->val)+get(root->left,sum-root->val)+get(root->right,sum-root->val):0;
    }