#include <stdio.h>
int main(void)
{
int i;
int j;
int sum = 0;
int val = 1;
/*
for (j = 1; j < 11; j++)
{
for (i = 1,val = 1; i <= j; i++) //计算n的阶乘之前每一次把val初始为1,此处必须要初始化val
{
val = val * i;
}
sum = val + sum;
}
*/
//改进:
for (j = 1; j < 10; j++) //j=1时 val=1*1; j=2时,val=1*2; j=3时val=1*2*3 每次sum都会求和,相对上面代码,时间复杂度为O(n)
{
val = val * j;
sum = val + sum;
}
printf("sum = %d", sum);
return 0;
}版权声明:本文为dzq0311原创文章,遵循CC 4.0 BY-SA版权协议,转载请附上原文出处链接和本声明。