路径总和 III

题目

题源

代码

码源

class Solution {
    public int pathSum(TreeNode root, int targetSum) {
        if (root == null) return 0;
        int result = pathSumStartWithRoot(root, targetSum) + pathSum(root.left,targetSum) + pathSum(root.right,targetSum);
        return result;
    }
    private int pathSumStartWithRoot(TreeNode root, int sum) {
        if (root == null) return 0;
        int result = 0;
        if (root.val == sum) result++;
        result += pathSumStartWithRoot(root.left, sum - root.val) + pathSumStartWithRoot(root.right, sum - root.val);
        return result;
    }
}