C语言程序设计(数据结构)——实现单链表的各种基本运算的算法

main.cpp

//==========头文件==============
#include<stdio.h>
#include<stdlib.h>
//=========重定义变量类型============
typedef char ElemType;
typedef struct LNode
{
	ElemType data;
	struct LNode * next;
}LinkNode;
//=========头插法============
void CreateListF(LinkNode *&L,ElemType a[],int n)
{
	LinkNode * s;
	L = (LinkNode *)malloc(sizeof(LinkNode));
	L->next = NULL;
	for(int i=0;i<n;i++)
	{
		s = (LinkNode *)malloc(sizeof(LinkNode));
		s->data = a[i];
		s->next = L->next;
		L->next = s;
	}
}
//=========尾插法============
void CreatListR(LinkNode *&L,int a[],int n)
{
	LinkNode * s, * r;
	L = (LinkNode *)malloc(sizeof(LinkNode));
	r = L;
	for(int i=0;i<n;i++)
	{
		s = (LinkNode *)malloc(sizeof(LinkNode));
		s->data = a[i];
		r->next = s;
		r = s;
	}
	r->next = NULL;
}
//==========初始化线性表============
void InitList(LinkNode *&L)
{
	L = (LinkNode *)malloc(sizeof(LinkNode));
	L->next = NULL;
}
//==========销毁线性表=============
void DestroyList(LinkNode *&L)
{
	LinkNode * pre = L, * p = L->next;
	while(p!=NULL)
	{
		free(pre);
		pre = p;
		p = pre->next;
	}
	free(pre);
}
//======判断线性表是否为空=========
bool ListEmpty(LinkNode *&L)
{
	return(L->next==NULL);
}
//=======求线性表长度============
int ListLength(LinkNode *&L)
{
	int n=0;
	LinkNode * p = L;
	while(p->next!=NULL)
	{
		n++;
		p = p->next;
	}
	return(n);
}
//========输出线性表============
void DispList(LinkNode *L)
{
	LinkNode * p = L->next;
	while(p!=NULL)
	{
		printf("%c ",p->data);
		p = p->next;
	}
	printf("\n");
}


//========求线性表中第i个元素值==========
bool GetElem(LinkNode *L, int i, ElemType &e)
{
	int j = 0;
	LinkNode *p = L;							
	if(i <= 0) return false;				
	while(j < i && p != NULL)
	{					
		j++;											
		p = p->next;
	}
	if(p == NULL)
		return false;						
	else
	{								
		e = p->data;
		return true;
	}
}
 
//========查找第一个值为e的元素符号=======
int LocateElem(LinkNode *L, ElemType e)
{
	int i = 1;
	LinkNode *p = L->next;						
	while(p != NULL && p->data != e)
	{			
		p = p->next;
		i++;
	}
	if(p == NULL)							
		return 0;
	else								
		return i;
}
 
//============插入第i个元素=============
bool ListInsert(LinkNode *&L, int i, ElemType e)
{
	int j = 0;
	LinkNode *p = L, *s;					
	if(i <= 0)								
		return false;
	while(j < i - 1 && p != NULL)
	{			
		j++;
		p = p->next;
	}
	if(p == NULL)
		return false;
	else
	{									
		s = (LinkNode *)malloc(sizeof(LinkNode));
		s->data = e;
		s->next = p->next;
		p->next = s;
		return true;
	}
}
 
//============删除第i个元素=============
bool ListDelete(LinkNode *&L, int i, ElemType &e)
{
	int j = 0;
	LinkNode *p = L, *q;					
	if(i <= 0)
		return false;
	while(j < i - 1 && p != NULL)
	{			
		j++;
		p = p->next;
	}
	if(p == NULL)
		return false;
	else
	{									
		q = p->next;
		if(p == NULL)
			return false;
		e = q->data;
		p->next = q->next;
		free(q);
		return true;
	}
}
//=============主函数================
void main()
{
	LinkNode *h;
	ElemType e;
	printf("单链表的基本运算如下：\n");
	printf("  (1)初始化单链表 h\n");
	InitList(h);
	printf("  (2)依次采用尾插法插入a,b,c,d,e,元素\n");
	ListInsert(h,1,'a');
	ListInsert(h,2,'b');
	ListInsert(h,3,'c');
	ListInsert(h,4,'d');
	ListInsert(h,5,'e');
	printf("  (3)输出单链表h：");	DispList(h);
	printf("  (4)单链表h长度：%d\n", ListLength(h));
	printf("  (5)单链表h为%s\n", (ListEmpty(h)?"空":"非空"));
	GetElem(h, 3, e);
	printf("  (6)单链表h的第3个元素：%c\n", e);
	printf("  (7)元素a的位置：%d\n", LocateElem(h,'a'));
	printf("  (8)在第4个元素位置上插入f元素\n");
	ListInsert(h,4,'f');
	printf("  (9)输出单链表h：");	DispList(h);
	printf("  (10)删除h的第3个元素\n");
	ListDelete(h,3,e);
	printf("  (11)输出单链表h：");	DispList(h);
	printf("  (12)释放单链表h\n");
	DestroyList(h);
}
 

代码运行结果：