[LeetCode] 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
用了两个递归函数,其中的一个 pathSumStartWithRoot 递归函数是以当前结点为起点,和为 sum 的路径个数,采用了前序遍历,对于每个遍历到的节点进行处理,我们判断当前root的值是否等于sum 若是等于则ret加1,然后对当前节点的左右子节点调用递归函数求解sum-root.val,这是pathSumStartWithRoot 递归函数。而在 pathSum 函数中,我们对当前结点调用pathSumStartWithRoot 函数,加上对左右子结点调用 pathSum 递归函数,三者的返回值相加就是所求,参见代码如下:
其实我们要考虑每个节点开始的路径是否存在和为sum的情况,但是一个递归函数是无法办到的。那么只能考虑两个递归函数,一个函数负责处理节点开始的这个路径pathSumStartWithRoot,另一个函数负责处理调用每个路径函数pathSum
class Solution {
public int pathSum(TreeNode root, int sum) {
if(root == null)
return 0;
int ret = pathSumStartWithRoot(root,sum) + pathSum(root.left, sum) + pathSum(root.right, sum);
return ret;
}
private int pathSumStartWithRoot(TreeNode root, int sum){
if(root == null)
return 0;
int ret = 0;
if(root.val == sum)
ret++;
ret += pathSumStartWithRoot(root.left, sum - root.val) +
pathSumStartWithRoot(root.right, sum - root.val);
return ret;
}
}