链表不带表头。
int FindMax(LinkList List)
{
if (List == NULL)
{
return 404;
}
if (List->next!= NULL)
{
return List->data > FindMax(List->next) ? List->data : FindMax(List->next);
}
else
{
return List->data;
}
}
int count(LinkList List)
{
if (List == NULL)
{
return 404;
}
if (List->next != NULL)
{
return 1+ count(List->next);
}
else
{
return 1;
}
}
float averge(LinkList List, int length)
{
if (List->next != NULL)
{
return (averge(List->next, length - 1)*(length - 1) + List->data)*1.0 / length;
}
else
{
return List->data;
}
}