Java 0ms recursive

  • 0

    Similar with post from someone else, but somehow got 0ms execution time rather than 1ms. Can anyone explain this?

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