Why doesn't this work?


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

    This is not working for some case, but what is wrong?


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.