删除链表结点.txt

来自「用于计算多边形的面积,体积,长度, 用于操作系统的开发 用于数据的加密」· 文本 代码 · 共 74 行

#include<iostream.h>
struct Student
{
	long number;
	float score;
	Student * next;
};
Student * Create()
{
	Student * head;
	Student * pS;
	Student * pEnd;
	pS=new Student;
	cin>>pS->number>>pS->score;
	head=NULL;
	pEnd=pS;
	while(pS->number!=0)
	{
		if(head==NULL)
			head=pS;
		else
			pEnd->next=pS;
		pEnd=pS;
		pS=new Student;
		cin>>pS->number>>pS->score;
	}
	pEnd->next=NULL;
	delete pS;
	return(head);
}
void ShowList(Student * head)
{
	cout<<"now the items of list are\n";
	while(head)
	{
		cout<<head->number<<","<<head->score<<endl;
		head=head->next;
	}
}
void Delete(Student * head,long number)
{
	Student * p;
	if(!head)
	{
		cout<<"\nList null!\n";
		return;
	}
	if(head->number==number)
	{
		p=head;
		head=head->next;
		delete p;
		cout<<number<<"the head of list has been deleted\n";
		return;
	}
	for(Student * pGuard=head;pGuard->next;pGuard=pGuard->next)
	{
		if(pGuard->next->number==number)
		{
			p=pGuard->next;
			pGuard->next=p->next;
			delete p;
			cout<<number<<"has been deleted";
			return;
		}
	}
	cout<<number<<"is not found!\n";
}
void main()
{
	Student *head;
	head=Create();
	Delete(head,54);
}