链表的操作综合

//建立链表的算法
#include<stdio.h>
#include<malloc.h>
#define NULL 0
#define LEN sizeof(struct student)
struct student{
	long num;
	float score;
	struct student *next;
}; 
int n;
int main(){
	struct student* creat();
	struct student *p1,*p2,*p3,*p4,*p5;
	struct student stu;
	p1 = creat();
	p3=p1;
	if(p1!=NULL){
		printf("一共%d条链表数据：\n",n);
		do{
			printf("%ld  %f\n",p1->num,p1->score);
			p1=p1->next;
		}while(p1!=NULL);
	}
	struct student* del(struct student *,long );
	struct student* insert(struct student *,struct student * );
	printf("请输入要删除的序号：\n");
	long num;
	scanf("%ld",&num);
	p2=del(p3,num);
	p4=p2;
	if(p2!=NULL){
		printf("一共%d条链表数据：\n",n);
		do{
			printf("%ld  %f\n",p2->num,p2->score);
			p2=p2->next;
		}while(p2!=NULL);
	}
	printf("请输入插入条目\n");
	scanf("%ld,%f",&stu.num,&stu.score);
	p5=insert(p4,&stu);
	if(p5!=NULL){
		printf("一共%d条链表数据：\n",n);
		do{
			printf("%ld  %f\n",p5->num,p5->score);
			p5=p5->next;
		}while(p5!=NULL);
	}
}
struct student *creat(){
	struct student *head;
	struct student *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;
		}else{
			p2->next=p1;
			p2=p1;
		}
		p1=(struct student *)malloc(LEN);
		scanf("%ld,%f",&p1->num,&p1->score);
	}
	p2->next=NULL;
	return(head);
}
//删除结点的函数
struct student* del(struct student *head,long num){
	struct student *p1,*p2;
	if(head==NULL){
		printf("是空的");
		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;
		}
		printf("%ld已删除",num);
		n=n-1;
	}else{
		printf("找不到");
	}
	return head;
}
//插入结点函数
struct student * insert(struct student *head,struct student * stud){
	struct student *p0,*p1,*p2;
	p1=head;
	p0=stud;
	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;
				p0->next=p1;	
			}else{
				p2->next=p0;
				p0->next=p1;
			}
		}else{
			p1->next=p0;
			p0->next=NULL;
		}
	}
	n=n+1;
	return (head);
}