📄 插入链表结点.txt
字号:
#include<iostream.h>
struct Student
{
long number;
double 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 Insert(Student * head,Student * stud)
{
if(head==NULL)
{
head=stud;
stud->next=NULL;
return;
}
if(head->number>stud->number)
{
stud->next=head;
head=stud;
return;
}
Student * pGuard=head;
while(pGuard->next&&pGuard->next->number<stud->number)
pGuard=pGuard->next;
stud->next=pGuard->next;
pGuard->next=stud;
}
void main()
{
Student * head;
Student ps;
ps.number=36;
ps.score=3.8;
head=Create();
Insert(head,&ps);
ShowList(head);
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -