本题要求实现两个函数,一个将输入的学生成绩组织成单向链表;另一个将成绩低于某分数线的学生结点从链表中删除。
函数接口定义:
struct stud_node *createlist();
struct stud_node *deletelist( struct stud_node *head, int min_score );
函数createlis
利用scanf
从输入中获取学生的信息,将其组织成单向链表,并返回链表头指针。
输入为若干个学生的信息(学号、姓名、成绩),当输入学号为0时结束。
函数deletelist
从以head
为头指针的链表中删除成绩低于min_score
的学生,并返回结果链表的头指针。
裁判测试程序样例:
#include <stdio.h>
#include <stdlib.h>
struct stud_node {
int num;
char name[20];
int score;
struct stud_node *next;
};
struct stud_node *createlist();
struct stud_node *deletelist( struct stud_node *head, int min_score );
int main()
{
int min_score;
struct stud_node *p, *head = NULL;
head = createlist();
scanf("%d", &min_score);
head = deletelist(head, min_score);
for ( p = head; p != NULL; p = p->next )
printf("%d %s %d\n", p->num, p->name, p->score);
return 0;
}
/* 你的代码将被嵌在这里 */
输入样例:
1 zhang 78
2 wang 80
3 li 75
4 zhao 85
0
80
输出样例:
2 wang 80
4 zhao 85
通过代码
//创建链表
struct stud_node *createlist()
{
struct stud_node *p, *head = NULL, *tail;
int x;
scanf("%d",&x);
while(x) {
p = (struct stud_node*)malloc(sizeof(struct stud_node));
p -> num = x;
scanf("%s %d", p->name, &p->score);
p -> next = NULL;
if(head == NULL) head = p;
else tail -> next = p;
tail = p;
scanf("%d", &x);
}
return head;
}
//删除链表中的节点
struct stud_node *deletelist( struct stud_node *head, int min_score )
{
struct stud_node *tail, *p;
//先处理链表从头就需要删除的情况
while(head!=NULL && head->score < min_score){
p = head; //用p标记head方便释放空间
head = head->next;
free(p); //释放内存空间
}
if(head == NULL)
return NULL; //如果删空了则直接返回NULL
//处理正常情况,head中成绩大于min_score
p = head;
tail = p -> next;
while(tail != NULL) {
if(tail->score < min_score) {
p->next = tail->next; //tail前节点连接tail后节点
free(tail); //释放内存
}else p = tail;
tail = p -> next;
}
return head;
}