c语言链表练习(创建、删除、插入链表)

关于单链表的建立，删除，和插入

#include<stdio.h>
#include<malloc.h>
#define LEN sizeof(struct student)
struct student{
	int num;
	struct student *next;
};
int n;

//建立链表函数
struct student *creat()
{
	struct student *head,*p1,*p2;
	n=0;
	p1=p2=(struct student *)malloc(LEN);
	scanf("%d",&p1->num);
	head=NULL;
	while(p1->num!=0){
		n+=1;
		if(n==1) head=p1;
		else p2->next=p1;
		p2=p1;
		p1=(struct student *)malloc(LEN);
		scanf("%d",&p1->num);
	}
	p2->next=NULL;
	return head;
}

//定义删除链表函数
struct student *del(struct student *head,int num)
{
	struct student *p1,*p2;
	if(head==NULL){
		printf("\nlist null!\n");
		return head;
	}
	p1=head;
	while(num!=p1->num&&p1->next!=NULL){
		p2=p1;
		p1=p1->next;
	}
	if(p1->num==num){
		if(p1==head) head=p1->next;
		else p2->next=p1->next;
		printf("delete:%d\n",num);
		n=n-1;
	}
	else printf("%d not been found!\n",num);
	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;
				else p2->next=p0;
				p0->next=p1;
		}
		else{
				p1->next=p0;
				p0->next=NULL;
		}
		return head;
	}
}

//定义输出链表函数
void print(struct student *head)
{
	struct student *p;
	printf("\nNow,these %d records are:",n);
	p=head;
	if(head=!NULL)
		do{
			printf("%d",p->num);
			p=p->next;
		}while(p!=NULL);
}

//主函数
int main()
{
	struct student *head,stu;
	int num;
	printf("input records:\n");
	head=creat();
	print(head);
	printf("input delete number:");
	scanf("%d",&num);
	head=del(head,num);
	print(head);
	printf("input the inserted record:");
	scanf("%d",&stu.num);
    head=insert(head,&stu);
	print(head);
	return 0;
}

要想插入或删除多个结点时，只需将主函数改成下面情况：

int main()
{
	struct student *head,*stu;
	int num;
	printf("input records:\n");
	head=creat();
	print(head);
	printf("input delete number:");//输入要删除的学号
	scanf("%d",&num);
	while(num!=0){
		head=del(head,num);
		print(head);
		printf("input the deleted number:");
		scanf("%d",&num);
	}
	printf("input the inserted record:");//输入要插入的结点
	stu=(struct student *)malloc(LEN);
	scanf("%d",&stu->num);
	while(stu->num!=0){
	//每次循环都要给stu开辟新的内存空间来存放结构体数据
		head=insert(head,stu);
		print(head);
		pritnf("input the inserted number:");
		stu=(struct student *)malloc(LEN);
		scanf("%d",&stu->num);
	}
	return 0;
}