编写程序STUDENT *Create(STUDENT studs[],int n)。

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

struct student//定义结点结构体
{
char name[10];
int score;
struct student *next;
};

typedef struct student STUDENT;
typedef struct student* Link;

void create_link(Link *head)
{
*head = NULL;
}

void is_malloc_ok(Link new_node)
{
if(NULL == new_node)
{
printf("malloc error!\n");
exit(-1);
}
}

void create_new_node(Link *new_node)
{
*new_node = (Link)malloc(sizeof(STUDENT));
is_malloc_ok(*new_node);
}

void insert_new_node(Link *head, Link new_node)
{//由成绩从小到大排序，插入新结点
Link tmp = NULL;
Link q = NULL;

tmp = *head;
q = *head;

if(NULL == *head)//空链表，头插新结点
{
new_node->next = NULL;
*head = new_node;
}
else
{
while ((new_node->score > tmp->score) && (tmp->next != NULL))
{
q = tmp;
tmp = tmp->next;
}
if (new_node->score < tmp->score)
{
if (*head == tmp)
{
new_node->next = tmp;
*head = new_node;
}
else
{
new_node->next = tmp;
q->next = new_node;
}
}
if ((new_node->score > tmp->score) && (tmp->next==NULL))
{
tmp->next = new_node;
new_node->next = NULL;
}
}
}

STUDENT *create(STUDENT studs[], int n)
{
int i;
Link head = NULL;
Link new_node = NULL;

create_link(&head);

for (i = 0; i < n; i++)
{
create_new_node(&new_node);
strcpy(new_node->name,studs[i].name);
new_node->score = studs[i].score;
new_node->next = studs[i].next;
insert_new_node(&head, new_node);
}

return head;
}

void display_link(Link head)
{
Link tmp = NULL;

tmp = head;

while (tmp->next != NULL)
{
printf("The score %s is %d\n",tmp->name,tmp->score);
tmp = tmp->next;
if (tmp->next == NULL)
{
printf("The score %s is %d\n",tmp->name,tmp->score);
break;
}
}

}

int main()
{
int n;
int i;
Link head = NULL;
STUDENT studs[10];

printf("Enter number of students!(<=10)\n");
scanf("%d",&n);
printf("Enter name and score!\n");

for (i = 0; i < n; i++)
{
scanf("%s",studs[i].name);
scanf("%d",&(studs[i].score));
studs[i].next = NULL;
}

head = create(studs,n);

display_link(head);

return 0;
}