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

因为不一定是从根节点开始，所以，得到的结果是从所有节点开始的并且满足条件的总数。对于当前节点，满足条件的和 = 从当前节点开始的总数 + 从俩儿子节点开始的总数。使用dfs去计算从当前节点满足的个数(root->val == sum ? 1 : 0) + dfs(root->left, sum - root->val) + dfs(root->right, sum - root->val);递归调用本身计算当前节点与儿子节点们的总个数dfs(root, sum) + pathSum(root->left, sum) + pathSum(root->right, sum);。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int pathSum(TreeNode* root, int sum) {
        if(root == NULL) return 0;

        return dfs(root, sum) + pathSum(root->left, sum) + pathSum(root->right, sum);
    }

    int dfs(TreeNode* root, int sum)
    {
        if(root == NULL) return 0;

        return (root->val == sum ? 1 : 0) + dfs(root->left, sum - root->val) + dfs(root->right, sum - root->val);

    }
};