【无标题】

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>

typedef int ElemType;
typedef struct Lnode {
	ElemType data;
	struct Lnode * next;
}LinkNode;

//1.头插法创建单链表
char CreateListl(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;								//将元素循环放入单链表
	}
	return printf("头插法：成功创建单链表\n");
}

//2.尾插法创建单链表
char CreateListr(LinkNode*& L, ElemType 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;
	return printf("尾插法：成功创建单链表\n");
}

//3.输出单链表
char DispList(LinkNode* L) {
	LinkNode* p = L->next;
	while (p!=NULL)
	{
		printf("%d", p->data);
		p = p->next;
	}
	return printf("成功输出\n");
}

//4.初始化单链表
char InitList(LinkNode*& L) {
	L = (LinkNode*)malloc(sizeof(LinkNode));
	L->next = NULL;
	return printf("成功初始化单链表\n");
}

//5.销毁单链表
char DestroyList(LinkNode*& L) {
	LinkNode* pre=L, * p = L->next;
	while (p!=NULL)
	{
		free(pre);
		pre = p;
		p = pre->next;
	}
	free(pre);
	return printf("成功销毁单链表\n");
}

//6.判断单链表是否为空
char ListEmpty(LinkNode*& L) {
	if (L->next == NULL)
		return  printf("该链表为空\n");
	else
		return  printf("该链表非空\n");
}

//7.求单链表的长度
char ListLength(LinkNode*& L) {
	int n = 0;
	LinkNode* p = L;
	while (p->next!=NULL)
	{
		n++;
		p = p->next;
	}
	return printf("该链表的长度是%d\n",n);
}

//8.求i中单链表的元素
char GetElem(LinkNode* L, int i, ElemType e) {
	int j = 0;
	LinkNode* p = L;
	while (j<i  &&  p!=NULL)
	{
		j++;
		p = p->next;
	}
	if (p == NULL)
		return 0;
	else
	{
		e = p->data;
		return true;
	}
}

//9.按元素值查找
char 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 false;
	else
		return i;
}

//10.单链表数据的插入
char 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 printf("成功插入\n");
	}

}

//11.单链表数据的删除
char 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 (q == NULL) return false;
		e = q->data;
		p->next = q->next;
		free(q);;
		return printf("成功删除第i个元素");
	}
}


int main() {
	LinkNode* L;
	int a[5] = { 1,2,3,4,5 };
	//1.头插法创建单链表
	CreateListl(L, a, 5);

	//2.尾插法创建单链表
	//CreateListr(L, a, 5);

	//3.输出单链表
	//DispList(L);

	//4.初始化单链表
	//InitList(L)

	//5.销毁单链表
	//DestroyList(L);

	//6.判断单链表是否为空
	//ListEmpty(L);

	//7.求单链表的长度
	//ListLength(L);


	//8.求i中单链表的元素
	//int i, e;
	//GetElem(L,i,e);

	//9.按元素值查找
	//int e;
	//LocateElem(L, e);

	//10.单链表数据的插入
	//ListInsert(L, i, e);

	//11.单链表数据的删除
	//ListDelete(L, i, e);
	return 0;
}