案例:求1!+2!+3!+…+n!
/*
思路:先求1+...+n的和;然后将n换成阶乘
*/
#include<stdio.h>;
int algorithm(int n)
{
if (n == 1)
{
return 1;
}
int factorial = n * algorithm(n - 1); //递归方式
return factorial;
}
void main()
{
int k = 4;
int sum = 0;
for (int i = 1; i <= k; i++)
{
int m = algorithm(i); //求阶乘
sum += m; //求和
}
printf("%d\n", sum);
}