数据结构线性表链式实现作业

#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>
#define OK 1 //通过
#define ERROR 0 //错误 
typedef int Status; //函数类型,其值为状态码
typedef char ElemType; //抽象数据类型
//单链表
typedef struct LNode
{
	ElemType data;
	struct LNode *next;
}LNode, *LinkList;
//初始化
Status initList(LinkList* L)
{
	*L = (LinkList)malloc(sizeof(LNode));
	(*L)->data = 0;
	(*L)->next = NULL;
	return OK;
}
//判空
char* isEmpty(LinkList* L)
{
	return (*L)->next == NULL ? "空" : "不空";
}
//获取长度
int getLength(LinkList* L)
{
	LinkList p = *L;
	int i = 0;
	while (p->next)
	{
		++i;
		p = p->next;
	}
	return i;
}
//默认头插法建表
Status creatListHead(LinkList* L)
{
	LinkList p ;
	char str[] = "myGithub:https://github.com/pengxiandyou";
	(*L)->data=(int)_mbstrlen(str);
	for (int i = 0; i <(int)_mbstrlen(str); ++i)
	{
		p= (LinkList)malloc(sizeof(LNode));
		p->data = str[i];
		p->next = (*L)->next;
		(*L)->next = p;
	}
	return OK;
}
//默认尾插法建表 
Status creatListEnd(LinkList* L)
{
	LinkList p,r=*L;
	char str[] = "myGithub:https://github.com/pengxiandyou";
	(*L)->data = (int)_mbstrlen(str);
	for (int i = 0; i < (int)_mbstrlen(str); ++i)
	{
		p = (LinkList)malloc(sizeof(LNode));
		p->data = str[i];
		p->next = NULL;//必须要否则遍历异常
		r ->next= p;
		r = p;
	}
	return OK;
}
//遍历表
Status traversalList(LinkList L)
{
	LinkList p = L->next;
	while (p)
	{
		printf("%c", p->data);
		p = p->next;
	}
	printf("\n");
	return OK;
}
//插入
Status insertList(LinkList* L, int i ,char c)
{
	if (L == NULL || (i > (*L)->data || i < 1))return ERROR;
	LinkList p=*L;
	int j = 0;
	while (p&&j<i-1)
	{
		p = p->next;//定在前一个
        j++;
	}
	LinkList q = (LinkList)malloc(sizeof(LNode));
	q->data = c;
	q->next = p->next;
	p->next = q;
	(*L)->data++;
	return OK;
}
//按位查找
LNode* getListByIndex(LinkList L, int i)
{
	//if (L == NULL || (i > (L)->data || i < 1))return NULL;
	LinkList p = L;
	int j = 0;
	while (p&&j<i - 1)
	{
		p = p->next;//前一个
		j++;
	}
//	p = p->next;
	return (p);//前一个
}
//按值查找
LNode* getListByElem(LinkList L, char c ,int* i)
{
	LinkList p = L;
	int j = 0;
	while (p&&p->next->data!=c)
	{
		p = p->next;//前一个
		j++;
	}
	*i = j + 1;
	return p; //前一个
}
//删除 通过索引
Status deleteListElem(LinkList* L, int i)
{
	LinkList p = getListByIndex(*L, i);
	LinkList q = p->next;
	p->next = p->next->next;
	free(q);
	(*L)->data--;
	return OK;
}
//删除 通过值 
Status deleteListElem(LinkList* L, char c,int* i)
{
	LinkList p = getListByElem(*L, c,i);
	LinkList q = p->next;
	p->next = p->next->next;
	free(q);
	(*L)->data--;
	return OK;
}
//逆置链表
Status Reverse(LinkList* L)
{
	LinkList p = (*L)->next;
	LinkList q = *L;
	LinkList s;
	while (q->next)
	{
		q = q->next;
	}
	while (p!=q)
	{
		s = q->next;
		q->next = p;
		(*L)->next = p->next;
		p->next = s;
		p = (*L)->next;
	}
	return OK;
}
//改值 根据索引
Status changeElemByIndex(LinkList* L,char c, int i)
{
	getListByIndex(*L, i)->next->data = c;
	return OK;
	
}
//中间结点 运用快慢指针
//快慢指针可以判断是否为环,两链表是否相交等
LNode* findListMiddle(LinkList L)
{
	LinkList fast, slow;
	int i;
	fast = slow = L;

	for (i = 0; fast != NULL&&fast->next != NULL; fast = fast->next->next)
	{
		slow = slow->next;
		i++;
	}
	return slow;
}
//删除表
Status deleteALL(LinkList* L)
{
	LinkList p = *L, q;
	while (p->next)
	{
		q = p->next;
		p->next = q->next;
		(*L)->data--;
		free(q);
	}
	free(p);
	return OK;
}
int main(void)
{
	LinkList L;
	//初始化
	printf("开始初始化\n");
	printf("初始化-------%s\n", initList(&L)==OK?"成功":"失败");
	//判空
	printf("单链表为-----%s\n", isEmpty(&L));
	//获取长度
	printf("单链表长度为-%d\n",getLength(&L));
	//建表
	printf("开始建表,使用默认头插法方式,尾插法未使用\n");
	printf("建表---------%s\n", creatListHead(&L)==OK?"成功":"失败");
	printf("单链表长度为-%d\n", getLength(&L));
	//遍历表
	printf("开始遍历\n");
	printf("遍历---------%s\n", traversalList(L) == OK ? "成功" : "失败");
	//逆转链表
	printf("开始逆转\n");
	printf("逆转-------------------%s\n", Reverse(&L) == OK ? "成功" : "失败");
	printf("遍历-------------------%s\n", traversalList(L) == OK ? "成功" : "失败");
	printf("逆转-------------------%s\n", Reverse(&L) == OK ? "成功" : "失败");
	printf("遍历-------------------%s\n", traversalList(L) == OK ? "成功" : "失败");
	//中间结点
	printf("寻找中间结点\n");
	LNode* s = findListMiddle(L);
	printf("地址为 %d\t值为 %c\n",s ->next, s->data);
	//查找
	printf("开始查找\n");
	int i = 0;
	LNode* t= getListByElem(L, 'h', &i);
	printf("按值(h)查找,值为 %c\t索引为 %d\n", t->next->data, i);
	t = getListByIndex(L, 20);
	printf("按为(20)查找,值为 %c\n", t->next->data);
	//插入
	printf("开始插入\n");
	printf("在索引1处插入!---------%s\n", insertList(&L,1,'!') == OK ? "成功" : "失败");
	printf("单链表长度为-%d\n", getLength(&L));
	printf("遍历---------%s\n", traversalList(L) == OK ? "成功" : "失败");
	//改值
	printf("开始改值\n");
	printf("更改索引1处的值为%%-----%s\n", changeElemByIndex(&L, '%', 1) == OK ? "成功" : "失败");
	printf("遍历--------------------%s\n", traversalList(L) == OK ? "成功" : "失败");
	//删除
	printf("开始删除\n");
	printf("通过索引1\n");
	deleteListElem(&L, 1);
	printf("单链表长度为-----------%d\n", getLength(&L));
	printf("遍历-------------------%s\n", traversalList(L) == OK ? "成功" : "失败");
	printf("通过值#\n");
	printf("在索引1处插入#---------%s\n", insertList(&L, 1, '#') == OK ? "成功" : "失败");
	printf("单链表长度为-----------%d\n", getLength(&L));
	printf("遍历-------------------%s\n", traversalList(L) == OK ? "成功" : "失败");
	int j = 0;
	deleteListElem(&L,'#', &j);
	printf("单链表长度为-----------%d\n", getLength(&L));
	printf("遍历-------------------%s\n", traversalList(L) == OK ? "成功" : "失败");
	//删除表
	printf("开始删除表\n");
	printf("删除-------------------%s\n", deleteALL(&L) == OK ? "成功" : "失败");
	system("pause");
	return 0;
}