My three line Java code


  • -1
    G

    public boolean hasPathSum(TreeNode root, int sum) {
    if(root == null) return false;
    else if(root.left == null && root.right ==null && root.val == sum) return true;
    else return hasPathSum(root.left,sum-root.val) || hasPathSum(root.right,sum-root.val);
    }


Log in to reply
 

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