Path Sum III

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

这道题运用的就是二叉树递归,基本上来说就是要区分遍历到的节点是否属于结果中的一个,于是就写出了第一版

开始时候想法,很简单就四行,但是发现运行后出错,出错的原因是正如例子中展示的树,3的左孩子还是3,于是下方代码运行会得到4

就是多计算了5->3(第一个),5->3(第二个),下方代码将包含与未包含进行了混淆,产生错误

if(root==null) return 0;
if(root.val==sum) return 1;
if(root.left==null&&root.right==null) return 0;
return pathSum(root.left,sum)+pathSum(root.right,sum)+pathSum(root.left,sum-root.val)+pathSum(root.right,sum-root.val);

以下为第二版,将包含与未包含进行分离

public class PathSumIII_437 {
    public int pathSum(TreeNode root, int sum) {
        if (root == null) return 0;
        return containPath(root, sum) + pathSum(root.left, sum) + pathSum(root.right, sum);
    }

    private int containPath(TreeNode root, int sum) {
        if (root == null) return 0;
        int res = 0;
        if (root.val == sum) res++;
        res += containPath(root.left, sum - root.val);
        res += containPath(root.right, sum - root.val);
        return res;
    }
}