Leetcode-标签为Tree 437. Path Sum III

最新推荐文章于 2024-05-28 15:10:43 发布

zg1g

最新推荐文章于 2024-05-28 15:10:43 发布

阅读量510

点赞数 2

分类专栏：算法/LeetCode 经典算法，LeetCode题目研究文章标签： leetcode 二叉树路径

本文链接：https://blog.csdn.net/daigualu/article/details/70342773

版权

经典算法，LeetCode题目研究同时被 2 个专栏收录

225 篇文章 18 订阅

订阅专栏

算法/LeetCode

223 篇文章 1 订阅

订阅专栏

原题

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

题目分析

求所有可能的从上到小的路径的和等于某个值的个数。先求出根到叶子的路径上的数据和等于给定值的个数，然后递归即可。

代码实现

       public int PathSum(TreeNode root, int sum)
       {
           int cnt = onePathSum(root, sum);
           if (root != null)
               cnt += PathSum(root.left, sum) + PathSum(root.right, sum);
           return cnt;
       }

       private int onePathSum(TreeNode root, int sum)
       {
           if (root == null)
               return 0;
           int cnt = 0;
           if (root.val == sum)
               cnt = 1;
           //求以root为根的路径val和等于sum的
           cnt += onePathSum(root.left, sum - root.val);
           cnt += onePathSum(root.right, sum - root.val);
           return cnt;
       }