for (int i = 0; i <= 25; i++)
System.out.printf("%d! = %,d\n", i, factorial(i));
上面的代码初始化了下面的阶乘方法:
public static long factorial(int num1)
{
if (num1 == 0)
return 1;
else
return Math.abs(num1 * factorial(num1 - 1));
}
因此创建了以下输出:
0! = 1
1! = 1
2! = 2
3! = 6
4! = 24
5! = 120
6! = 720
7! = 5,040
8! = 40,320
9! = 362,880
10! = 3,628,800
11! = 39,916,800
12! = 479,001,600
13! = 6,227,020,800
14! = 87,178,291,200
15! = 1,307,674,368,000
16! = 20,922,789,888,000
17! = 355,687,428,096,000
18! = 6,402,373,705,728,000
19! = 121,645,100,408,832,000
20! = 2,432,902,008,176,640,000
21! = 4,249,290,049,419,214,848
22! = 1,250,660,718,674,968,576
23! = 8,128,291,617,894,825,984
24! = 7,835,185,981,329,244,160
25! = 7,034,535,277,573,963,776
21 的结果!是错误的(应该是 51,090,942,171,709,440,000)，结果对于 22 就完全乱套了!以上。谁能解释一下为什么？
最佳答案
第 21 个及以上的值变得不稳定，因为真实值对于 long 来说太大了。如果您需要更大的数字，请使用 BigInteger .
关于java - 阶乘函数产生 21 的错误结果!以上，我们在Stack Overflow上找到一个类似的问题： https://stackoverflow.com/questions/13282402/