12.22 day4 链表

思维导图

1、单向链表任意元素查找

2、单向链表任意元素修改

3、单向链表任意元素删除

4、单向链表逆置（面试）

5、单向链表查找倒数第n个节点（面试）

6、单向链表排序

7、单向链表释放内存

head.h

#ifndef __HEAD_H__
#define __HEAD_H__
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
enum{FALSE=-1,SUCCESS};
typedef int datatype;
typedef struct Node
{
	datatype data;
	struct Node *next;
}*Linklist;

Linklist create_node();
Linklist insert_head(Linklist head,datatype element);
void output(Linklist head);
Linklist delete_head(Linklist);
Linklist insert_tail(Linklist head,datatype element);
Linklist delete_tail(Linklist head);
int length(Linklist head);
Linklist insert_pos(Linklist head,int pos,datatype element);
Linklist delete_pos(Linklist head,int pos);
Linklist find_pos(Linklist head,int pos);
Linklist change_pos(Linklist head,int pos,datatype element);
Linklist find_element(Linklist head,datatype element);
Linklist change_element(Linklist head,datatype element,datatype new_element);
Linklist delete_element(Linklist head,datatype element);
Linklist reverse(Linklist head);
Linklist find_reverse(Linklist head,int n);
void  bubble(Linklist head);
Linklist free_space(Linklist head);
#endif

text.c

#include"head.h"

Linklist create_node()
{
	Linklist p=(Linklist)malloc(sizeof(struct Node));
	if(NULL==p)
		return NULL;
	p->data=0;
	p->next=NULL;
	return p;
}
Linklist insert_head(Linklist head,datatype element)
{
	Linklist s=create_node();
	if(NULL==s)
		return head;
	s->data=element;
	s->next=head;
	head=s;
	return head;
}
void output(Linklist head)
{
	if(NULL==head)
		return;
	Linklist p=head;
	while(p!=NULL)
	{
		printf("%d\t",p->data);
		p=p->next;
	}
	printf("\n");
}
Linklist insert_tail(Linklist head,datatype element)
{
	Linklist s=create_node();
	if(NULL==s)
		return head;
	s->data=element;
	if(NULL==head)
	{
		head=s;
	}
	else
	{
		Linklist p=head;
		while(p->next!=NULL)
		{
			p=p->next;
		}
		p->next=s;
		s->next=NULL;
	}
	return head;
}
Linklist delete_head(Linklist head)
{
	if(NULL==head)
		return head;
	Linklist del=head;
	head=head->next;
	free(del);
	del=NULL;
	return head;
}
Linklist delete_tail(Linklist head)
{
	if(NULL==head)
		return head;
	if(head->next==NULL)
	{
		free(head);
		head=NULL;
	}
	Linklist p=head;
	while(p->next->next!=NULL)
	{
		p=p->next;
	}
	free(p->next);
	p->next=NULL;
	return head;
}
int length(Linklist head)
{
	int len=0;
	Linklist p=head;
	while(p->next==NULL)
	{
		p=p->next;
		len++;
		return len;
	}
}
Linklist insert_pos(Linklist head,int pos,datatype element)
{
	if(pos<1 || pos>length(head)+1)
		return head;
	if(pos==1)
	{
		head=insert_head(head,element);
		return head;
	}
	Linklist p=head;
	for(int i=1;i<pos-1;i++)
	{
		p=p->next;
	}
	Linklist s=create_node();
	if(NULL==s)
		return head;
	s->data=element;
	s->next=p->next;
	p->next=s;
	return head;
}
Linklist delete_pos(Linklist head,int pos)
{
	if(NULL==head)
		return head;
	if(pos<1 || pos>length(head))
		return head;
	if(pos==1)
		head=delete_head(head);
	Linklist p=head;
	for(int i=1;i<pos-1;i++)
	{
		p=p->next;
	}
	Linklist del=p->next;
	p->next=del->next;
	free(del);
	del=NULL;
	return head;
}
Linklist find_pos(Linklist head,int pos)
{
	Linklist p=head;
	if(NULL==head||pos<1||pos>length(head))
		return head;
	for(int i=1;i<pos;i++)
	{
		p=p->next;
	}
	printf("%d\n",p->data);
}
Linklist change_pos(Linklist head,int pos,datatype element)
{
	Linklist p=head;
	if(NULL==head||pos<1||pos>length(head))
		return head;
	for(int i=1;i<pos;i++)
	{
		p=p->next;
	}
	p->data=element;
	return head;
}
Linklist find_element(Linklist head,datatype element)
{
	if(NULL==head)
		return head;
	Linklist p=head;
	int pos=0;
	while(p!=NULL)
	{
		pos++;
		if(element==p->data)
		printf("pos=%d\n",pos);
		p=p->next;
	}
	return head;
}
Linklist change_element(Linklist head,datatype element,datatype new_element)
{
	if(NULL==head)
		return head;
	Linklist p=head;
	int pos=0;
	while(p!=NULL)
	{
		pos++;
		if(element==p->data)
			p->data=new_element;
		p=p->next;
	}
	return head;
}
Linklist delete_element(Linklist head,datatype element)
{
	if(NULL==head)
		return head;
	Linklist p=head;
	int pos=0;
	while(p!=NULL)
	{
		pos++;
		if(element==p->next->data)
		{
			Linklist del=p->next;
			p->next=del->next;
			free(del);
			del=NULL;
			return head;
		}
		else
			p=p->next;
	}
	return head;
}
Linklist reverse(Linklist head)
{
	Linklist p=head;
	if(NULL==head||length(head)==1)
		return head;
	p=head->next;
	head->next=NULL;
	while(p!=NULL)
	{
		Linklist t=p;
		p=p->next;
		t->next=head;
		head=t;
	}
	return head;
}
Linklist find_reverse(Linklist head,int n)
{
	if(NULL==head)
		return head;
	Linklist p=head;
	Linklist q=head;
	for(int i=0;i<n;i++)
	{
		p=p->next;
	}
	while(p!=NULL)
	{
		p=p->next;
		q=q->next;
	}
	printf("q->data=%d\n",q->data);
	return head;
}
void bubble(Linklist head)
{
	if(NULL==head || NULL==head->next)
		return;
	for(Linklist i=head;i->next!=NULL;i=i->next)
	{

		Linklist min=i;
		for(Linklist j=i->next;j!=NULL;j=j->next)
		{
			if(min->data >j->data)
				min=j;
			if(min!=i)
			{
				datatype t=min->data;
				min->data=i->data;
				i->data=t;
			}
		}
	}
}
Linklist free_space(Linklist head)
{
	if(NULL==head)
		return head;
	Linklist p=head;
	while(p!=NULL)
	{
		p=delete_head(p);
	}
	head=NULL;
	return head;
}

main.c

#include"head.h"

int main(int argc, const char *argv[])
{
	Linklist head=NULL;
	int n,pos;
	datatype element,new_element;
	printf("enter n:");
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		printf("enter %d element:",i+1);
		scanf("%d",&element);
		head=insert_tail(head,element);
	}
	output(head);
	printf("enter a pos:");
	scanf("%d",&pos);
	insert_tail(head,element);
	head=delete_head(head);
	head=delete_tail(head);
	head=insert_pos(head,pos,element);
	head=delete_pos(head,pos);
	find_pos(head,pos);	
	printf("enter a pos:");
	scanf("%d",&pos);
	printf("enter an element:");
	scanf("%d",&element);
	head=change_pos(head,pos,element);
	find_element(head,element);
	printf("enter a new_element:");
	scanf("%d",&new_element);
	change_element(head,element,new_element);
	head=delete_element(head,element);
	head=reverse(head);
	printf("enter n:");
	scanf("%d",&n);
	find_reverse(head,n);
	bubble(head);
	output(head);
	printf("%p\n",head);
	head=free_space(head);
	printf("%p\n",head);

	return 0;
}