leetcode 437 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

给定一个二叉树，计算其所有路径和等于输入值的路径数。本题是在之前的计算从根节点到叶节点路径和等于指定值的基础上进行了扩充，即可以从任意中间节点向下遍历得到指定值即可。因此，对于每一个节点，其值可以有三种情况组成，加上该节点的值向下进行遍历、跳过该节点遍历左子节点、跳过该节点遍历右子节点。代码如下：

/**
 * 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(nullptr == root)
            return 0;
        return findPath(root, sum) + pathSum(root->left, sum) + pathSum(root->right, sum);
    }
    
    int findPath(TreeNode* root, int sum)
    {
        if(nullptr == root)
            return 0;
        return (root->val == sum ? 1 : 0) + findPath(root->left, sum - root->val) + findPath(root->right, sum - root->val);        
    }
};