java用非递归的方法求阶乘_你会如何编写一个非递归算法来计算阶乘？

Java中的非递归阶乘。这个解决方案是用自定义迭代器(来演示迭代器的使用:))。

/**

* Non recursive factorial. Iterator version,

*/

package factiterator;

import java.math.BigInteger;

import java.util.Iterator;

public class FactIterator

{

public static void main(String[] args)

{

Iterable fact = new Iterable()

{

@Override

public Iterator iterator()

{

return new Iterator()

{

BigInteger i = BigInteger.ONE;

BigInteger total = BigInteger.ONE;

@Override

public boolean hasNext()

{

return true;

}

@Override

public BigInteger next()

{

total = total.multiply(i);

i = i.add(BigInteger.ONE);

return total;

}

@Override

public void remove()

{

throw new UnsupportedOperationException();

}

};

}

};

int i = 1;

for (BigInteger f : fact)

{

System.out.format("%d! is %s%n", i++, f);

}

}

}