C语言链表

#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>

#define LEN sizeof(struct student)

struct student
{
	long num;
	float score;
	struct student *next;
};

int n;

struct student * creat(void)
{
	struct student *head;
	struct student *p1,*p2;
	head = NULL;
	n=0;
	p1 = p2 = (struct student *)malloc(LEN);
	scanf("%ld,%f",&p1->num,&p1->score);
	
	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;
}



void main()

{
	struct student *pt;
	pt=creat();
	do
	{
		printf("%ld,%f\n",pt->num,pt->score);
		pt = pt->next;
	}while(pt != NULL);
	printf("\n");



}
	

删除

#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>

#define LEN sizeof(struct student)

struct student
{
	long num;
	float score;
	struct student *next;
};

int n;

struct student * creat(void)
{
	struct student *head;
	struct student *p1,*p2;
	head = NULL;
	n=0;
	p1 = p2 = (struct student *)malloc(LEN);
	scanf("%ld,%f",&p1->num,&p1->score);
	
	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,int num)
{

	struct student *p1,*p2,*hdel;
	p1=p2=head;
	int s=0;
	hdel = NULL;
	while(p1 != NULL)
	{
		s = s+1;
		if(s==1)
		{			
			hdel = p1;
		}
		else
			if(s!=num)
			{
				p2->next = p1;			
			}
		if(s!=num)
		{
			p2 = p1;
						
		}	
		
		p1 = p1->next;
		
	}
	p2->next = NULL;

	return hdel;
}
					



void main()

{
	struct student *pt,*pdel;
	pt=creat();

	printf("请输入你要删除的链: ");
	int num;
	scanf("%d",&num);

	pdel = del(pt,num);
	do
	{
		printf("%ld,%f\n",pdel->num,pdel->score);
		pdel = pdel->next;
	}while(pdel != NULL);

}

增加

#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>

#define LEN sizeof(struct student)

struct student
{
	long num;
	float score;
	struct student *next;
};

int n;

struct student * creat(void)
{
	struct student *head;
	struct student *p1,*p2;
	head = NULL;
	n=0;
	p1 = p2 = (struct student *)malloc(LEN);
	scanf("%ld,%f",&p1->num,&p1->score);
	
	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 * create(struct student *head,int num)
{

	struct student *p1,*p2,*p3,*hcr;
	p1=p2=head;
	int s=0;
	hcr = NULL;
	while(p1 != NULL)
	{
		s = s+1;
		if(s==1)
		{			
			hcr = p1;
		}
		else
			if(s!=num)
			{
				p2->next = p1;			
			}
			else
			{
				printf("请输入你要插入的数据: ");
				p3 = (struct student *)malloc(LEN);
				scanf("%ld,%f",&p3->num,&p3->score);
				p3->next = p1;
				p2 ->next = p3;
				
			}
		if(s!=num)
		{
			p2 = p1;
						
		}	
		else 
		{
			p3 = p1;
			p2 = p3;
		}
		
		p1 = p1->next;
		
	}
	p2->next = NULL;

	return hcr;
}
					



void main()

{
	struct student *pt,*pcr,*t;
	int num;
	pt=creat();
	t=pt;

	do
	{
		printf("%ld,%f\n",pt->num,pt->score);
		pt = pt->next;
	}while(pt != NULL);
	printf("\n");




	printf("请输入你要插入的链位置: ");
	scanf("%d",&num);


	pcr = create(t,num);
	do
	{
		printf("%ld,%f\n",pcr->num,pcr->score);
		pcr = pcr->next;
	}while(pcr != NULL);

}