java小算法给个总结先（一）---阶乘算法

一、利用简单的循环

public class Factorial {
    public static int factorial(int x) {
        if (x < 0) {
            throw new IllegalArgumentException("x must be>=0");
        }
        int fact = 1;
        for (int i = 2; i <= x; i++) {
            fact *= i;
        }
        return fact;
    }

   public static void main(String args[]) {

        System.out.print(factorial(10));
    }
}

二、使用递归

public class factorial2 {
    public static int factorial2(int x) {
        if (x < 0) {
            throw new IllegalArgumentException("x must be>=0");
        }
        if (x <= 1) {
            return 1;
        } else
            return x * factorial2(x - 1);
    }


    public static void main(String args[]) {

        System.out.print(factorial2(17));
    }
}

三、数组添加的方法制成的，可以计算更大的阶乘。

public class Factorial3 {
    static long[] table = new long[21];
    static {table[0] = 1; }

    static int last = 0;
    public static long factorial(int x) throws IllegalArgumentException {
        if (x >= table.length) {
            throw new IllegalArgumentException("Overflow; x is too large.");
        }
        if (x <= 0) {
            throw new IllegalArgumentException("x must be non-negative.");
        } while (last < x) {
            table[last + 1] = table[last] * (last + 1);
            last++;
        }
        return table[x];
    }
        public static void main(String[] args) {

四、利用BigInteger类制成的，这里可以用更大的更大的阶乘。

import java.math.BigInteger;
import java.util.*;
public class Factorial4{
    protected static ArrayList table = new ArrayList();
    static{ table.add(BigInteger.valueOf(1));}

    public static synchronized BigInteger factorial(int x){
        for(int size=table.size();size<=x;size++){
            BigInteger lastfact= (BigInteger)table.get(size-1);
            BigInteger nextfact= lastfact.multiply(BigInteger.valueOf(size));
            table.add(nextfact);
        }
        return (BigInteger) table.get(x);
    }
}

            System.out.print(factorial(20));
        }
    }