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

思路：divide and conquer, 包含root的解的个数 + 左右两边的子问题个数；

helper function，一定要包含root的计算结果；

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int pathSum(TreeNode root, int targetSum) {
        if(root == null) {
            return 0;
        }
        //  必须包含root的个数 +           左边子问题个数                + 右边子问题个数；
        return dfs(root, targetSum, 0) + pathSum(root.left, targetSum) + pathSum(root.right, targetSum);
    }
    
    private int dfs(TreeNode root, int targetSum, int cursum) {
        if(root == null) {
            return 0;
        } else {
            int count = 0;
            if(cursum + root.val == targetSum) {
                count++;
            }
            count += dfs(root.left, targetSum, cursum + root.val);
            count += dfs(root.right, targetSum, cursum + root.val);
            return count;
        }
    }
}