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 Mysum(TreeNode*root,int cur,int sum)
    {
        if(!root)
            return 0;
        cur=cur+root->val;
        return (cur==sum)+Mysum(root->left,cur,sum)+Mysum(root->right,cur,sum);
        
        
    }
    
    int pathSum(TreeNode* root, int sum) {
        int cur=0;
        if(root==nullptr)
            return 0;
        return Mysum(root,cur,sum)+pathSum(root->left,sum)+pathSum(root->right,sum);
        
    }
};