day4:单向链表

思维导图

按照元素查找

按照元素修改

按元素删除

链表逆置

链表倒数查找

链表排序

源码：

head.h

#ifndef __head_h__
#define __head_h__
#include <stdio.h>
#include<string.h>
#include<stdlib.h>
typedef int dake;
enum 
{
	false=-1,
	success
};
typedef struct node
{
	dake data;
	struct node *next;
}*sake;
sake create(sake p);
sake headin(sake p,dake element);
int output(sake head);
sake tailin(sake head,dake element);
sake headdel(sake head);
sake taildel(sake head);
void search(sake head,dake element);
sake in(sake head,int pos,dake element);
sake del(sake head,int pos);
void find(sake head,int pos);
void repair(sake head,int pos,dake element);
void repair2(sake head,dake key1,dake key2);
sake del2(sake head,dake element);
sake deput(sake head);
void find2(sake head,int n);
void bubble(sake head);
sake fre(sake head);
#endif

main.c

#include "head.h"
int main(int argc, const char *argv[])
{
	int n;
	sake head=NULL;
	dake element;
	int pos;
	printf("请输入你要创建链表的个数n");
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		printf("请输入%d个值",i+1);
		scanf("%d",&element);
	//	head=headin(head,element);
		head=tailin(head,element);
	}
	output(head);
	head=headdel(head);
	printf("头删的结果为\n");
	output(head);
	head=taildel(head);
	printf("尾删的结果为\n");
	output(head);
	printf("请输入你插入元素的位置");
	scanf("%d",&pos);
	printf("请输入你要插入的元素");
	scanf("%d",&element);
	head=in(head,pos,element);
	printf("请输入你删除元素的位置");
	scanf("%d",&pos);
	head=del(head,pos);
	output(head);
	printf("请输入你要查找的元素");
	scanf("%d",&pos);
	find(head,pos);
	printf("请输入你修改元素的位置");
	scanf("%d",&pos);
	printf("请输入你要修改成的的元素");
	scanf("%d",&element);
	repair(head,pos,element);
	output(head);
	printf("请输入要查找的元素");
	scanf("%d",&element);
	search(head,element);
	dake key1,key2;
	printf("请输入你修改的元素");
	scanf("%d",&key1);
	printf("请输入你要修改成的的元素");
	scanf("%d",&key2);
	repair2(head,key1,key2);
	output(head);
	printf("请输入你要删除的的元素");
	scanf("%d",&element);
	head=del2(head,element);
	output(head);
	head=deput(head);
	output(head);
	printf("请输入你要查找的倒数第几个数");
	scanf("%d",&n);
	find2(head,n);
	bubble(head);
	output(head);
	fre(head);
	return 0;
}

test.c

#include "head.h"
sake create(sake p)
{
	p=(sake)malloc(sizeof(struct node));
	if(p==NULL)
		return NULL;
	p->data=0;
	p->next=NULL;
	return p;
}
sake headin(sake head,dake element)
{
	sake s=create(s);
	if(s==NULL)
		return head;
	s->data=element;
	s->next=head;
	head = s;
	return head;
}
int output(sake head)
{
	if(head==NULL)
		return false;
	sake p=head;
	while(p!=NULL)
	{
		printf("%-4d",p->data);
		p=p->next;
	}
	puts("");
	return success;
}
sake tailin(sake head,dake element)
{
	sake s=create (s);
	s->data=element;
	if(NULL==head)
	{
		head=s;
		return head;
	}
	sake p=head;
	while(p->next!=NULL)
	{
		p=p->next;
	}
	p->next=s;
	return head;
}
sake headdel(sake head)
{
	if(head==NULL)
		return head;
	sake p=head;
	head=head->next;
	free(p);
	p=NULL;
	return head;
}
sake taildel(sake head)
{
	if(head==NULL)
		return NULL;
	if(head->next==NULL)
	{
		free(head);
		head=NULL;
		return head;
	}
	sake q=head;
	while(q->next->next!=NULL)
	{
		q=q->next;
	}
	free(q->next);
	q->next=NULL;
	q=NULL;
	return head;	
}
int length(sake head)
{
	sake p=head;
	int count=0;
	while(p!=NULL)
	{
		p=p->next;
		count++;
	}
	return count;
}
sake in(sake head,int pos,dake element)
{
	if(pos<1||pos>length(head)+1)
		return head;
	if(pos==1)
	{
		head=headin(head,element);
		return head;
	}
	sake p=head;
	for(int i=1;i<pos-1;i++)
	{
		p=p->next;
	}
	sake s=create(s);
	if(s==NULL)
		return NULL;
	s->data=element;
	s->next=p->next;
	p->next=s;
	return head;
}
sake del(sake head,int pos)
{
	if(head==NULL||pos<1||pos>length(head))
		return head;
	if(pos==1)
	{
		head=headdel(head);
		return head;
	}
	sake p=head;
	sake q=NULL;
	for(int i=1;i<pos-1;i++)
	{
		p=p->next;
		q=p->next;
	}
	p->next=q->next;
	free(q);
	q=NULL;
	return head;
}
void find(sake head,int pos)
{
	if(pos<1||pos>length(head)||head==NULL)
		return;
	sake p=head;
	for(int i=1;i<pos;i++)
	{
		p=p->next;
	}
	printf("您查找的元素为%d\n",p->data);
}
void repair(sake head,int pos,dake element)
{
	if(pos<1||pos>length(head)||head==NULL)
		return;
	sake p=head;
	for(int i=1;i<pos;i++)
	{
		p=p->next;
	}
	p->data=element;
}


void search(sake head,dake element)
{
	int count=0;
	if(head==NULL)
		return;
	sake p=head;
	while(p!=NULL)
	{
		count++;
		if(p->data==element)
		{
			printf("已找到该元素是第%d个元素\n",count);
			break;
		}
		p=p->next;
	}
	return;
}
void repair2(sake head,dake key1,dake key2)
{
	if(head==NULL)
		return;
	sake p=head;
	while(p!=NULL)
	{
		if(p->data==key1)
		{
			p->data=key2;
		}
		p=p->next;
	}
}
sake del2(sake head,dake element)
{
	if(head==NULL)
		return NULL;
	sake p=head;
	while(p->next->data!=element)
	{
		p=p->next;
	}
	sake q=p->next;
	p->next=q->next;
	free(q);
	q=NULL;
	return head;
}
sake deput(sake head)
{
	if(head==NULL||head->next==NULL)
		return head;
	sake p=head->next;
	sake q=head->next;
	head->next=NULL;
	while(q!=NULL)
	{
		q=q->next;
		p->next=head;
		head=p;
		p=q;
	}
	return head;
}
void find2(sake head,int n)
{
	if(head==NULL||n<1||n>length(head))
		return;
	sake p=head;
	sake q=head;
	for(int i=0;i<n;i++)
	{
		p=p->next;
	}
	while(p!=NULL)
	{
		p=p->next;
		q=q->next;
	}
	printf("倒数第%d个元素为%d\n",n,q->data);
}
void bubble(sake head)
{
	sake p=head;
	int i,j;
	int len=length(head);
	for(i=1;i<len;i++)
	{
		p=head;
		for(j=0;j<len-i;j++)
		{
			if(p->data>p->next->data)
			{
				dake t=p->data;
				p->data=p->next->data;
				p->next->data=t;
			}
			p=p->next;
		}
	}
}
sake fre(sake head)
{
	if(head==NULL)
		return NULL;
	int len=length(head);
	for(int i=0;i<len;i++)
	{
		head=headdel(head);
	}
	head=NULL;
}