链表求平均

#include <stdio.h>
#include <stdlib.h>
#define N 8
struct slist
{
    double s;
    struct slist *next;
};

typedef struct slist STREC;
double fun( STREC *h )
{
    STREC *t; double a=0;
    t=h->next;
    while(t)
    {
        a+=t->s;
        t=t->next;
    }
    return a/N;
}

STREC * creat( double *s)
{
    STREC *h,*p,*q;
    int i=0;
    h=p=(STREC*)malloc(sizeof(STREC));
    p->s=0;

    while(i<N)
    {
        q=(STREC*)malloc(sizeof(STREC));
        q->s=s[i];
        i++;
        p->next=q;
        p=q;
    }
    p->next=0;

    return h;
}

double outlist( STREC *h)
{
    STREC *p;
    p=h->next;

    printf("head");
    do{
        printf("->%4.1f",p->s);
        p=p->next;

    } while(p!=0);

    printf("\n\n");
}

int main()
{
    double s[N]={85,76,69,85,91,72,64,87},ave;
    STREC *h;
    h=creat( s );
    outlist(h);
    ave=fun( h );
    printf("ave= %6.3f\n",ave);

    return 0;
}