1.首先创建头指针并初始化，即头指针->next=NULL。接着创建链表指针，并用头指针初始化。
2.可用while循环获取信息，直到检测到输入值为0为止。在循环中，给链表指针申请新的内存空间，并初始化，同时因节点增加，指针不断后移。
3.删除函数，头节点单拿出来判断。创建临时指针保存满足条件的节点地址，进行删除操作。
#include<iostream>
using namespace std;
struct stud_node {
int num;
char name[20];
int score;
struct stud_node* next;
};
struct stud_node* createlist()
{
stud_node* fujia = new stud_node;/*创建头指针*/
fujia->next = NULL;
stud_node*temp=fujia;/*创建链表,指向头指针*/
cin >> temp->num;
while (temp->num)
{
cin >> temp->name >> temp->score;
temp->next = new stud_node;
temp = temp->next;
cin >> temp->num;
temp->next = NULL;
}
return fujia;
}
struct stud_node* deletelist(struct stud_node* head, int min_score)
{
if (head->score < min_score&&head)
{
stud_node* deletep = head;
head = deletep->next;
delete deletep;
}
for (stud_node* shanchu = head; shanchu!=NULL&&shanchu->next!= NULL; shanchu = shanchu->next)
{
if(shanchu->next->score<min_score)
{
stud_node*deletep = shanchu->next;
shanchu->next = deletep->next;
delete deletep;
}
}
return head;
}
int main()
{
int min_score;
struct stud_node* p, * head = NULL;
head = createlist();
cin >> min_score;
head = deletelist(head, min_score);
for (p = head; p != NULL; p = p->next)
cout << p->num << " " << p->name << " " << p->score << endl;
return 0;
}
PTA学生成绩链表处理
原文：https://www.cnblogs.com/hzy-bwd/p/11529914.html
