private long FactorialSum(int n,int i = 1,int value = 1,int sum = 1)
{
return i == n ? sum : FactorialSum(n, ++i, value *= i, sum += value);
}
递归_计算1-n的阶乘和
最新推荐文章于 2024-08-08 15:12:59 发布
private long FactorialSum(int n,int i = 1,int value = 1,int sum = 1)
{
return i == n ? sum : FactorialSum(n, ++i, value *= i, sum += value);
}