做题时只提交核心函数的代码即可
// 核心函数的实现
int FactorialSum(List listHead)
{
int sum = 0;
while (listHead != NULL)
{
int num = listHead->Data;
listHead = listHead->Next;
int factor = 1;
for (int cnt = 2; cnt <= num; ++cnt)
{
factor *= cnt;
}
sum += factor;
}
return sum;
}
本题要求实现一个函数,求单链表L
结点的阶乘和。这里默认所有结点的值非负,且题目保证结果在int
范围内。
函数接口定义:
int FactorialSum( List L );
完整的可执行代码(可以直接在本地编译并运行):
#include <stdio.h>
#include <stdlib.h>
typedef struct Node *PtrToNode;
struct Node
{
int Data; /* 存储结点数据 */
PtrToNode Next; /* 指向下一个结点的指针 */
};
typedef PtrToNode List; /* 定义单链表类型 */
int FactorialSum(List L);
int main(void)
{
int N = 0;
List list = NULL;
List p = NULL;
scanf("%d", &N);
for (int idx = 0; idx < N; ++idx)
{
p = (List)malloc(sizeof(struct Node));
scanf("%d", &p->Data);
p->Next = list;
list = p;
}
printf("%d\n", FactorialSum(list));
return 0;
}
// 核心函数的实现
int FactorialSum(List listHead)
{
int sum = 0;
while (listHead != NULL)
{
int num = listHead->Data;
listHead = listHead->Next;
int factor = 1;
for (int cnt = 2; cnt <= num; ++cnt)
{
factor *= cnt;
}
sum += factor;
}
return sum;
}
输入样例:
3
5 3 6
输出样例:
846