six lines solution in java


  • 0
    P

    public boolean hasPathSum(TreeNode root, int sum) {
    if (root == null)
    return false;

        if (root.left == null && root.right == null) {
            return (sum - root.val) == 0;
        }
    
        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.