链表的建立、输出、删除和插入（大一些的综合题）

#include<iostream>
using namespace std;
struct student
{
	long num;
	float score;
	student *next;
 } ;
int n;
int main()
{
	student *creat(void);//建立链表函数声明
	student *del(student *,long );//删除节点函数声明
	student *insert(student *,student *);//插入数据函数声明
	void print(student *);//输出函数声明
//定义结构体指针
	student *head,*stu;
	long del_num;
	//—————————— 
	cout<<"input records:"<<endl;   //输出输入的链表数据
	head=creat();
	print(head);
	//—————————— 
	cout<<endl<<"input the deleted number:";//删除数据
	cin>>del_num;
	while(del_num!=0)//用循环结构连续删除数据
	{
		head=del(head,del_num);
		print(head);
		cout<<"input the deleted number:";
		cin>>del_num;
	}
	//—————————— 
	cout<<endl<<"input the inserted record:";//插入数据
	stu=new student;
	cin>>stu->num>>stu->score;
	while(stu->num!=0)//用循环结构插入数据
	{
		head=insert(head,stu);
		print(head);
		cout<<endl<<"input the inserted record:";
		stu=new student;
		cin>>stu->num>>stu->score;
	}
	return 0;
}
student *creat(void)//建立链表函数定义
{
	student *head;
	student *p1,*p2;
	n=0;
	p1=p2=new student;
	cin>>p1->num>>p1->score;
	head=NULL;
	while(p1->num!=0)
	{
		n=n+1;
		if(n==1)
			head=p1;
		else
			p2->next=p1;
		p2=p1;
		p1=new student;
		cin>>p1->num>>p1->score;
	}
	p2->next=NULL;
	return (head);
}
student *del(student *head,long num)//删除节点数据定义
{
	student *p1,*p2;
	if(head==NULL)
	{
		cout<<"list null!"<<endl;
		return (head);
	}
	p1=head;
	while(num!=p1->num&&p1->next!=NULL)
	{
		p2=p1;
		p1=p1->next;
	}
	if(num==p1->num)
	{
		if(p1==head)
			head=p1->next;
		else
			p2->next=p1->next;
		cout<<"delete:"<<num<<endl;
		n=n+1;
	}
	else
		cout<<"cannot find "<<num;
	return (head);
}
student *insert(student *head,student *stud)//插入数据函数定义
{
	student *p0,*p1,*p2;
	p0=stud;
	p1=head;
	if(head==NULL)
	{
		head=p0;
		p0->next=NULL;
	}
	else
	{
		while((p0->num>p1->num)&&(p1->next!=NULL))
		{
			p2=p1;
			p1=p1->next;
		}
		if(p0->num<=p1->num)
		{
			if(head==p1)
				head=p0;
			else
				p2->next=p0;
			p0->next=p1;
		}
		else
		{
			p1->next=p0;
			p0->next=NULL;
		}
		n=n+1;
		return (head);
	}
}
void print(student *head)//输出函数定义
{
	student *p;
	cout<<endl<<"Now,These "<<n<<" records are:"<<endl;
	p=head;
	if(head!=NULL)
	{
		do
		{
			cout<<p->num<<' '<<p->score<<endl;
			p=p->next;
		}while(p!=NULL);
	}
}

运行结果：