leetcode 437. Path Sum III

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    
    int ans = 0;
    int pos;
    
    int solve(TreeNode root,int sum){
        
        if(root == null) return 0;
        
        return (root.val == sum?1:0)+solve(root.left,sum-root.val)
            +solve(root.right,sum-root.val);
    }
    
    public int pathSum(TreeNode root,int sum) {
        
        if(root == null) return 0;
        
        return solve(root,sum)+pathSum(root.left,sum)+pathSum(root.right,sum);
    }
}