标准链表

初学者。如果有误请指正，欢迎联系QQ2684162190

#include<stdio.h>
#include<malloc.h>
typedef struct Link{
	int date;
	struct Link * next;
}link;
link * initLink()
{
	link *Node;
	Node=(link*)malloc(sizeof(link));
	Node->date=-1000;
	Node->next=NULL;
	return Node;
}
void insertLink(link *head,int element)
{	
	link *p=head;
	link *Node=initLink();
	Node->date=element;
	while(p->next!=NULL)
	{
		p=p->next;
	}
	p->next=Node;
}
void deleteLink(link *head,int element)
{
	link *p,*q;
	p=head;
	q=head;
	if(p->next==NULL)
	{
		printf("链表为空\n");
		return ;
	}
	else
	{
		while(p->next!=NULL)
		{
			p=p->next;
			if(p->date==element)
			{
				q->next=p->next;
				break;
			}
			q=p;
		}
	}
}
void checkLink(link *head,int element)
{
	link *p=head;
	int flag=0;
	if(p->next==NULL)
	{
		printf("链表为空\n");
		return;
	}
	else{
		while(p->next!=NULL)
		{
			p=p->next;
			if(p->date==element)
			{
				printf("元素存在\n");
				flag=1;
				break;
			}
		}
		if(flag==0)
			printf("元素没找到\n");
	}
}
void updateLink(link *head,int oldElement,int newElement)
{
	link *p=head;
	int flag=0;
	if(p->next==NULL)
	{
		printf("该链表为空\n");
		return ;
	}
	else
	{
		while(p->next!=NULL)
		{
			p=p->next;
			if(p->date==oldElement)
			{
				p->date=newElement;
				flag=1;
				break;
			}
		}
		if(flag==0)//1.p==NULL 2.
			printf("没有找到要修改的值\n");
	}
}
void printLink(link *head)
{
	link *p=head;
	if(p->next==NULL)
	{
		printf("该链表为空\n");
		return ;
	}
	while(p->next!=NULL)
	{
		p=p->next;
		printf("%d ",p->date);
	}
}
void destoryLink(link* head)
{
	link *p,*q;
	p=head;
	q=head;
	while(p->next!=NULL)
	{
		p=p->next;
		free(q);
		q=p;
	}
	free(q);
	printf("链表已释放\n");
}
int main()
{
	link* head=initLink();
	int i;
	for(i=0;i<5;i++)
	{
		insertLink(head,i);
	}
	deleteLink(head,2);
	checkLink(head,2);
	updateLink(head,4,2);
	printLink(head);
	destoryLink(head);
	return 0;
}