链表实现结构体之成绩统计2

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

typedef struct student {

char id[10];

char name[10];

int mark1;

int mark2;

int mark3;

    struct student *next;

}Student;

Student* creat_list(int num)

{

Student* p = (Student*)malloc(sizeof(Student));

Student* next_one=p;

p->next = NULL;

int i;

for (i = 1; i <= num; i++)

{

Student* q = (Student*)malloc(sizeof(Student));

q->next = NULL;

next_one->next = q;

next_one = next_one->next;

}

return p;

}

void data_enter(Student* p,int n)

{

Student *q = p;

for (int i = 1; i <= n; i++)

{

scanf("%s %s %d %d %d", q->id,q->name, &(q->mark1), &(q->mark2), &(q->mark3));

q = q->next;

}

}

void average_print(Student* p,int n)

{

int mark1_aver=0, mark2_aver=0, mark3_aver=0;

Student* q = p;

for (int i = 1; i <= n; i++)

{

mark1_aver += q->mark1;

mark2_aver += q->mark2;

mark3_aver += q->mark3;

q = q->next;

}

mark1_aver = mark1_aver/ n;

mark2_aver = mark2_aver/ n;

mark3_aver = mark3_aver / n;

printf("%d %d %d\n", mark1_aver, mark2_aver, mark3_aver);

}

void top_stu_find(Student* p, int n)

{

Student* q = p;

int max = 0;

int average = 0;

int flag=0;

int i;

for ( i = 1; i <= n; i++)

{

average = q->mark1 + q->mark2 + q->mark3;

if (max < average)

{

max = average;

flag = i;

}

q = q->next;

}

q = p;

for ( i = 1; i < flag; i++)

{

q = q->next;

}

printf("%s %s %d %d %d\n", q->id, q->name, q->mark1, q->mark2, q->mark3);

}

void link_free(Student* p, int n)

{

Student* q = p;

Student* next_one;

for (int i = 1; i <= n; i++)

{

next_one = q->next;

free(q);

q = next_one;

}

p = NULL;

}

int main(void)

{

int n;

scanf("%d", &n);

Student *p = creat_list(n);

data_enter(p, n);

average_print(p,n);

top_stu_find(p, n);

link_free(p, n);

return 0;

}