链表的开辟空间、输出链表、插入、删除
#define LEN sizeof(struct student)
struct student{
int num;
float score;
struct student *next;
};
int n;
struct student *creat(void){
struct student *head,*p1,*p2;
n=0;
p1=p2=(struct student *)malloc(LEN);
scanf("%ld,%f",p1->num,p1->score);
head=NULL;
while(p1->num!=0){
n=n+1;
if(n==1){
head=p1;
p2->next=p1;
}
p2=p1;
p1=(struct student *) malloc(LEN);
scanf("%ld,%f",p1->num,p1->score);
}
p2->next=NULL;
free(p1);
return(head);
}
struct student *del(struct student *head,long num){
struct student *p1,*p2;
if(head==NULL){
printf("链表是空的\n"); goto end;
}
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;
}
printf("已删除:第%ld个节点\n",num);
n=n-1;
}else{
printf("%ld节点没有找到\n",num);
}
end:return(head);
}
struct student *insert(struct student *head,struct student *stu){
struct student *p0,*p1,*p2;
p1=head;p0=stu;
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(struct student *head){
struct student *p;
printf("这%d个记录是:\n",n);
p=head;
if(head!=NULL){
do{
printf("%ld%5.1f\n",p->num,p->score);
p=p->next;
}while(p!=NULL);
}
}
int main(){
struct student *head,stu;
long del_num;
printf("输出结点个数:\n",n);
head=creat();
print(head);
printf("输入要删除的结点num:\n");
scanf("%d",del_num);
head=del(head,del_num);
print(head);
printf("插入已经删除的数:\n");
scanf("%ld&6.2f",&stu.num,&stu.score);
head=insert(head,&stu);
print(head);
system("pause");
return 0;
}
int main(){
struct student *head,*stu;
long del_num;
printf("input records:\n");
head=creat();
print(head);
printf("\ninput the deleted number:");
scanf("ld",&del_num);
while(del_num!=0){
head=del(head,del_num);
print(head);
printf("input the deleted number:");
scanf("ld",&del_num);
}
printf("\ninput the inserted record:");
stu=(struct student *) malloc(LEN);
scanf("ld,%f",&stu->num,&stu->score);
while(stu->num!=0){
head=insert(head,stu);
printf("input the inserted record:");
stu=(struct student *) malloc(LEN);
scanf("ld,%f",&stu->num,&stu->score);
}
}