Tree——No.437 Path Sum III

No.437 Path Sum III

Problem：

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.

Explanation：

找到一棵树的任意结点开始往下的路径，相加值等于给定值的路径个数。

My Thinking：

My Solution：

Optimum Thinking:

使用递归对每个结点开始的路径计算总和。

Optimum Solution：

class Solution {
    public int pathSum(TreeNode root, int sum) {
        if(root==null)
            return 0;
        return recursive(root,sum)+pathSum(root.left,sum)+pathSum(root.right,sum);
    }
    public int recursive(TreeNode root,int sum){//返回从某一结点开始的路径的总和
        if(root==null)
            return 0;
        if(root.val==sum){
            return 1+recursive(root.left,sum-root.val)+recursive(root.right,sum-root.val);
        }else{
            return 0+recursive(root.left,sum-root.val)+recursive(root.right,sum-root.val);
        }
    }
}