创建学生成绩链表，并删除低于一定分数的节点

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
#include <stdio.h>
#include <stdlib.h>

typedef struct student
{
    int num;
    char name[10];
    int score;
    struct student *next;
}Student;

// typedef struct _list
// {
//     Student head;
// }List;


Student *Creat_Stu_Doc();   //创建链表
Student *DeleteDoc(Student*head,int min_score); //分数低于..删除
void Ptrint_Stu_Doc(Student *head);    //打印链表

int main()
{
    // List list;
    // list.head.next=NULL;
    // int number;
    // scanf("%d", &number);
    // if(number != 0){
    //     struct stud_node *Creat_Stu_Doc();
    // }

    Student *head;
    int minscore;
    head = Creat_Stu_Doc();
    scanf("%d", &minscore);
    Student *new = DeleteDoc(head, minscore);
    Ptrint_Stu_Doc(new);
    return 0;

}

Student *Creat_Stu_Doc()
{
    //List list;
    int number;
    Student *head=NULL, *tail=NULL;
    scanf("%d", &number);
    do{
        Student *p = (Student *)malloc(sizeof(Student));
        scanf("%s%d", &p->name, &p->score);
        p->num=number;
        p->next=NULL;

        if(head==NULL){
            head=p;
        }
        else{
            tail->next=p;
        }
        tail=p;
        
        scanf("%d", &number);
    }while(number!=0);

    return head;
}

Student *DeleteDoc(Student *head,int min_score)
{
    Student *p, *q;
    while(head != NULL&& head->score < min_score){
        p=head;
        head=head->next;
        free(p);
    }

    if(head==NULL)
        return NULL;
    
    else{
        for(q=NULL, p=head; p;q=p, p=p->next){
            if(p->score < min_score){
                q->next=p->next;
                free(p);
            }
        }
    }

    return head;
}

void Ptrint_Stu_Doc(Student *head)
{
    while(head!=NULL){
        printf("%d %s %dn", head->num, head->name, head->score);
        head = head->next;
    }
    return;
}