2024.1.24

//头文件：
#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();
Linklist insert_head(Linklist head,datatype element);
void output(Linklist head);
Linklist insert_rear(Linklist head,datatype element);
Linklist delete_head(Linklist head);
Linklist delete_rear(Linklist head);
Linklist anywhere_insert(Linklist head,int pos,datatype element);
Linklist delete_pos(Linklist head,datatype pos);
void update_pos(Linklist head,int pos,datatype element);
void search_pos(Linklist head,int pos);
Linklist rev(Linklist head);
void search_n(Linklist head,int n);
int length(Linklist head);
int search_key(Linklist head,datatype element,int len);
void update_key(Linklist head,datatype element,datatype num);
Linklist delete_key(Linklist head,datatype element,int len);
void Bubble(Linklist head,int len);
//Linklist free_space(Linklist head);
#endif
//主函数：
#include "head.h"

int main(int argc, const char *argv[])
{
	Linklist head=NULL;//定义单向链表的头指针
	int n;
	datatype element;//插入的值
	printf("please enter n:");
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		printf("please enter %dth element:",i+1);
		scanf("%d",&element);
		//head=insert_head(head,element);
		head=insert_rear(head,element);
	}
	
	//遍历
	output(head);

	int len=length(head);
	/*
	//头删
	head=delete_head(head);
	output(head);
	//尾删
	head=delete_rear(head);
	output(head);
	//按任意位置插入
	int pos;
	printf("please enter the position you want to insert:");
	scanf("%d",&pos);
	printf("please enter the num you want to insert:");
	scanf("%d",&element);
	head=anywhere_insert(head,pos,element);
	output(head);
	//任意位置删除
	printf("please enter the position you want to delete:");
	scanf("%d",&pos);
	head=delete_pos(head,pos);
	output(head);
	//任意位置查找
	printf("please enter the position you want to find:");
	scanf("%d",&pos);
	search_pos(head,pos);
	//任意位置修改
	printf("please enter the position you want to update:");
	scanf("%d",&pos);
	printf("please enter the new num:");
	scanf("%d",&element);
	update_pos(head,pos,element);
	output(head);
	
	head=rev(head);
	output(head);
	//查找倒数第n个
	printf("please enter n:");
	scanf("%d",&n);
	search_n(head,n);*/
	//按任意元素查找
	printf("please enter search num:");
	scanf("%d",&element);
	int pos=search_key(head,element,len);
	printf("the search position is %d\n",pos);
	//按任意元素修改
	printf("please enter the element you want to updata:");
	scanf("%d",&element);
	printf("please enter the new num:");
	datatype num;
	scanf("%d",&num);
	update_key(head,element,num);
	printf("the new list:");
	output(head);
	//按任意元素删除
	printf("please enter the element you want to delete:");
	scanf("%d",&element);
	head=delete_key(head,element,len);
	printf("The list after deleting show:");

	output(head);
	//单链表排序
	Bubble(head,len);
	output(head);
	//单链表释放
	//head=free_space(head);
	//head=NULL;
	return 0;
}
#include "head.h"

Linklist create()//创建新节点
{
	Linklist s=(Linklist)malloc(sizeof(struct Node));
	if(NULL==s)
		return NULL;
	//成功则初始化
	s->data=0;
	s->next=NULL;
	return s;
}
Linklist insert_head(Linklist head,datatype element)
{
	//创建新节点
	Linklist s=create();
	s->data=element;
	//1、判断链表是都为空
	if(NULL==head)
	{
		head=s;
	}
	else
	{
		s->next=head;
		head=s;
	}
	return head;


}
void output(Linklist head)
{
	if(NULL==head)
	{
		puts("empty");
		return;
	}
	//循环遍历
	Linklist p=head;
	while(p!=NULL)
	{
		printf("%-5d",p->data);
		p=p->next;//后移
	}
	puts("");
}
Linklist insert_rear(Linklist head,datatype element)
{
	//创建新节点
	Linklist s=create();
	s->data=element;

	//1、判断链表为空
	if(NULL==head)
		head=s;
	else
	{
		//循环到最后一个节点
		Linklist p=head;
		while(p->next!=NULL)
		{
			p=p->next;
		}
		p->next=s;
	}
	return head;
}
Linklist delete_head(Linklist head)
{
	if(NULL==head)
	return head;
	else
	{
		Linklist del=head;
		head=head->next;
		free(del);
		del=NULL;
	}

	return head;
}
Linklist delete_rear(Linklist head)
{
	if(NULL==head)
		return head;
	Linklist p=head;

		while(p->next==NULL)
		{
			free(head);
			head=NULL;
		}
		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)
	{
		p=p->next;
		len++;
	}
	return len;
}

Linklist anywhere_insert(Linklist head,int pos,datatype element)
{
	if(pos<1 || pos>length(head)+1)
	{
		puts("pos error");
		return head;
	}
		Linklist s=create();
		s->data=element;
		if(pos==1)
		{
			head=insert_head(head,element);
			return head;
		}
		Linklist p=head;
		for(int i=1;i<pos-1;i++)
			p=p->next;
		s->next=p->next;
		p->next=s;
		return head;
	
}
Linklist delete_pos(Linklist head,datatype pos)
{
	if(pos<1 || pos>length(head))
	{
		puts("pos error");
		return head;
	}
	if(NULL==head)
	{
		return head;
	}
	if(pos==1)
	{
		head=delete_head(head);
		return 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;
}
void search_pos(Linklist head,int pos)
{
	if(pos<1 || pos>length(head))
	{
		puts("pos error");
		return;
	}
	if(NULL==head)
	{
		puts("empty!");
		return;
	}
	Linklist p=head;
	for(int i=1;i<pos;i++)
		p=p->next;
	printf("your finding num is:%d\n",p->data);
}
void update_pos(Linklist head,int pos,datatype element)
{
	if(pos<1||pos>length(head))
	{
		puts("pos error");
		return;
	}
	if(NULL==head)
	{
		puts("empty");
		return;
	}
	Linklist p=head;
	for(int i=1;i<pos;i++)
		p=p->next;
	p->data=element;
}
Linklist rev(Linklist head)
{
	if(NULL==head)
		return head;
	Linklist p=head->next;
	head->next=NULL;
	//循环插入head链表
	Linklist t;
	while(p)
	{
		t=p;
		p=p->next;
		t->next=head;
		head=t;
	}
	return head;
}
void search_n(Linklist head,int n)
{
	if(NULL==head)
		return;
	Linklist p=head,q=head;
	for(int i=0;i<n;i++)
		p=p->next;
	while(p)
	{
		p=p->next;
		q=q->next;
	}
	printf("The searched num is :%d\n",q->data);
}
int search_key(Linklist head,datatype element,int len)
{
	if(NULL==head)
		return FALSE;
	Linklist p=head;
	int pos=1;
	for(int i=0;i<len;i++)
	{
		if(p->data==element)
		{
			return pos;
		}
		p=p->next;
		pos++;
	}
	return FALSE;

}
void update_key(Linklist head,datatype element,datatype num)
{
	if(NULL==head)
		return;
	Linklist p=head;
	int key=search_key(head,element,length(head));
	for(int i=1;i<key;i++)
	{
		p=p->next;
	}
	p->data=num;
}
Linklist delete_key(Linklist head,datatype element,int len)
{
	if(NULL==head)
		return head;
	int pos=search_key(head,element,len);
	head=delete_pos(head,pos);
	return head;
}
void Bubble(Linklist head,int len)
{
	if(NULL==head)
	  return;
	for(int i=1;i<len;i++)
	{
        Linklist p=head;
		for(int j=0;j<len-i;j++)
		{
			if(p->data > p->next->data)
			{
				datatype t=p->data;
				p->data=p->next->data;
				p->next->data=t;
			}
			p=p->next;
		}
	}
	

}
/*
Linklist free_space(Linklist head)
{
	if(NULL==head)
		return head;
	Linklist p=head;
	for(int i=0;i<length(head);i++)
	{
		head=head->next;
		free(p);	
		p=head;

	}
	return head;

}
*/