How to find factorial without using Recursion or loop in java?

问题

I need to find the factorial in java without using loop or recursion ? So if there is any way then please help . Thanks

回答1:

Slightly impractical but no explicit loop anywhere.

import javax.swing.Timer;
import java.awt.event.*;
import java.util.concurrent.ArrayBlockingQueue;

public class Fac {
    public static int fac(final int _n) {
        final ArrayBlockingQueue<Integer> queue = new ArrayBlockingQueue<Integer>(1);
        final Timer timer = new Timer(0, null);
        timer.addActionListener(new ActionListener() {
            int result = 1;
            int n = _n;
            public void actionPerformed(ActionEvent e) {
                result *= n;
                n--;
                if(n == 0) {
                    try {
                        queue.put(result);
                    } catch(Exception ex) {
                    }
                    timer.stop();
                }
            }
        });
        timer.start();
        int result = 0;
        try {
            result = queue.take();
        } catch(Exception ex) {
        }
        return result;
    }

    public static void main(String[] args) {
        System.out.println(fac(10));
    }
}

回答2:

Use Stirling approximation for Gamma function http://en.wikipedia.org/wiki/Stirling%27s_approximation

But it will be not precise.

回答3:

There is another post on here which you might like to have a look at:

Is there a method that calculates a factorial in Java?

Also - this link has lots of different implementations for factorial functions - you might find what you are looking for on here. At the very least, you will learn tons about factorials..

http://www.luschny.de/math/factorial/FastFactorialFunctions.htm

回答4:

Simple one liner solution, though internally it is doing a loop, as it can't possible without it, but you don't need to do it yourselves:

Long factorialNumber = LongStream.rangeClosed(2, N).reduce(1, Math::multiplyExact);

回答5:

You precompute the values.

More seriously, it's not really doable, since recursion and loops are inevitable if you might need to do arbitrarily much computation.

回答6:

We can do a functional factorial in Java 8 :

package com.promindis.jdk8;

import java.math.BigInteger;
import static java.math.BigInteger.*;

public class Factorial implements TCO {

  private TailCall<BigInteger> factorialTCO(
    final BigInteger fact, final BigInteger remaining) {
    if (remaining.equals(ONE))
      return done(fact);
    else
      return call(() ->
        factorialTCO(fact.multiply(remaining), dec(remaining)));
  }

  private BigInteger dec(final BigInteger remaining) {
    return remaining.subtract(ONE);
  }

  private BigInteger apply(final String from) {
    return factorialTCO(ONE, new BigInteger(from)).invoke();
  }

  public static void main(final String[] args) {
    System.out.println(new Factorial().apply("5"));
    System.out.println(new Factorial().apply("100"));

  }
}

source

来源：https://stackoverflow.com/questions/13433709/how-to-find-factorial-without-using-recursion-or-loop-in-java

标签

java

factorial