Three Line, 1ms simple JAVA solution


  • 3
    public boolean hasPathSum(TreeNode root, int sum) {
        if (root == null) return false;
        if (root.val == sum && root.left == null && root.right == null) return true;
        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.