Leetcode——437. Path Sum III

题目原址

https://leetcode.com/problems/path-sum-iii/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).
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值的子树个数。

这个题与572解题思路一样。都是通过递归实现。

AC代码

class Solution {
    public int pathSum(TreeNode root, int sum) {
        if(root == null)
                return 0;
        //path(root, sum)：判断从根节点开始的子树是否有满足条件的树
        //pathSum(root.left, sum)：递归判断根节点的左子树
        //pathSum(root.right, sum)：递归判断根节点的右子树
        return path(root, sum) + pathSum(root.left, sum) + pathSum(root.right, sum);
    }
    //判断一个树中有几条路径符合条件
    public int path(TreeNode root, int sum) {
        if(root == null) return 0;
        //如果当前的值等于sum,就说明找到了一条
        //如果不等于sum,就需要向其左子树，右子树寻找，但是这个时候需要将搜索的值变为sum-当前节点的值
        return (root.val == sum ? 1 : 0) 
                + path(root.left, sum - root.val) 
                + path(root.right, sum - root.val);
    }
}