[LeetCode]437. Path Sum III

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) {
        int result = 0;
        if(root == NULL)
            return result;
        find(root, sum, result);
        return result + pathSum(root->left, sum)+pathSum(root->right, sum);
    }

    // 给我一个起点，找出以这个点为起点的所有可能路径数
    void find(TreeNode* root, int target, int& result){
        if(root == NULL)
            return;
        if(root->val == target)
            ++result;
        if(root->left)
            find(root->left, target-root->val, result);
        if(root->right)
            find(root->right, target-root->val, result);
    }
};