题目:
本题要求实现两个函数,一个将输入的学生成绩组织成单向链表;另一个将成绩低于某分数线的学生结点从链表中删除。
函数接口定义:
struct stud_node *createlist();
struct stud_node *deletelist( struct stud_node *head, int min_score );
函数createlist
利用scanf
从输入中获取学生的信息,将其组织成单向链表,并返回链表头指针。链表节点结构定义如下:
struct stud_node {
int num; /*学号*/
char name[20]; /*姓名*/
int score; /*成绩*/
struct stud_node *next; /*指向下个结点的指针*/
};
输入为若干个学生的信息(学号、姓名、成绩),当输入学号为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
AC代码:
struct stud_node *createlist(){
int bufferNum;
struct stud_node* head = (struct stud_node*)malloc(sizeof(struct stud_node));
scanf("%d", &bufferNum);
if(bufferNum == 0){
head = NULL;
return head;
}
struct stud_node* pre, *p;
pre = p = head;
while(1){
pre->num = bufferNum;
scanf("%s", pre->name);
scanf("%d", &pre->score);
struct stud_node* p = (struct stud_node*)malloc(sizeof(struct stud_node));
scanf("%d", &bufferNum);
if(bufferNum == 0){
pre->next = NULL;
return head;
}
pre->next = p;
pre = pre->next;
}
return head;
}
//要点参见上一篇博客,不赘述
struct stud_node *deletelist( struct stud_node *head, int min_score ){
if(head == NULL) return head;
//注意1:要处理输入为空的情况
while(head && head->score < min_score){
if(head->next != NULL){
head = head->next;
}
else return NULL;
}
struct stud_node* p = head;
while(p->next != NULL){
while(p->next != NULL && p->next->score < min_score){
//注意2:p->next != NULL是必要的,因为else循环中将p->next赋值为NULL后,如果继续循环会直接访问p->next->score,会出错
if(p->next->next != NULL){
p->next = p->next->next;
}
else{
p->next = NULL;
//return head;也可以直接这样写,避免继续循环出错,但不必要
}
}
if(p->next != NULL) p = p->next;
}
return head;
}
总结:
多判断指针指的地方是否为空,会变得幸运。