【LeetCode】437. Path Sum III

437. Path Sum III

Description：
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.
Difficulty：Easy
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

方法1: Recursive

• Time complexity : $O\left(nlogn\right)$ ?
• Space complexity : $O\left(n\right)$
  思路：
  固定起点，遇到相等就加一，直至到叶子节点。

class Solution {
public:
    int pathSum(TreeNode* root, int sum) {
        if(!root) return 0;
        return fixStart(root, sum) + pathSum(root->left, sum) + pathSum(root->right, sum);
    }
    int fixStart(TreeNode* root, int sum){
        if(!root) return 0;
        if(root->val == sum)
            return fixStart(root->left, sum-root->val) + fixStart(root->right, sum-root->val) + 1;
        else
            return fixStart(root->left, sum-root->val) + fixStart(root->right, sum-root->val);
    }
};