线性表之单链表：详细操作代码

== == == == == == == == == == == == == == == == == == == == == == == ==
= = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =
以下是单链表的一些比较基础的操作，有关排序，感觉比较复杂，交给自己以后完成。

#include<stdio.h> 
#include<stdlib.h>
#define maxSize 100
typedef struct LNode
{
	int data;
	struct LNode *next;
}LinkNode;

void CreateListF(LinkNode* &L, int a[], int n)//头插法建立单链表
{
	LinkNode * s=NULL;
	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 CreateListR(LinkNode* &L, int a[], int n)//尾插法 rear
{
	LinkNode * s;
	LinkNode * q;
	L = (LinkNode*)malloc(sizeof(LinkNode));
	L->next = NULL;
	q = L;
	for (int i = 0; i < n; i++)
	{
		s = (LinkNode*)malloc(sizeof(LinkNode));
		s->data = a[i];
		q->next = s;
		s->next = NULL;
		q = s;

	}
}
void InitList(LinkNode* &L)//初始化链表 initiate 英[ɪˈnɪʃieɪt] 开始， 创始，开辟
{
	L = (LinkNode *)malloc(sizeof(LinkNode));
	L->next = NULL;
}
void DestroyList(LinkNode* &L)//销毁线性表 destroy [dɪˈstrɔɪ]杀死; 破坏，摧毁;
{
	LinkNode *p,*q;
	p = L;
	q = p->next;
	while (q!=  NULL)
	{
		free(p);
		p = q;
		q = q->next;
	}
	free(p);

}
bool ListEmpty(LinkNode * L)//判断是否为空表 empty[ˈempti]空的，空虚的，空洞的;
{
	return(L->next== NULL);
}
int ListLength(LinkNode * L)//返回线性表长度
{
	LinkNode *p;
	p = L;
	int e = 0;
	while (p->next != NULL)
	{
		e++;
		p = p->next;
	}
	return(e);
}
void DispList(LinkNode* L)//输出线性表
{
	if (L->next == NULL)
		printf("线性表为空");
	LinkNode *p=L->next;
	while (p != NULL)
	{
		printf("%d  ", p->data);
		p = p->next;
	}printf("\n");
		
}
bool Getint(LinkNode *L, int i, int &e)//求线性表中第X个元素的值
{
	if (L->next  ==  NULL||i<=0)
		return false;
	LinkNode *p = L->next;
	int j = 1;
	while (j < i)
	{
		if (p == NULL)
			return false;
		else
			p = p->next;
		j++;
	}e=p->data;
	return true;
}
int Locateint(LinkNode* L, int e)//按元素值查找，并返回逻辑序号 locate[ləʊˈkeɪt]查找…的地点; 确定…的位置

{
	LinkNode *p = L->next;
	int i = 1;
	while (p != NULL)
	{
		if (p->data == e)
			return i;
		else
		{
			p = p->next;
			i++;
		}
	}if (p == NULL)return -1;

}
bool ListInsert(LinkNode* &L, int i, int e)//插入数据元素,为第i个，data值为e
{
	LinkNode *p = L;
	int j = 1;
	while (p != NULL && j < i)
	{
		p = p->next;
		j++;
	}
	LinkNode *q=NULL;
	q = (LinkNode*)malloc(sizeof(LinkNode));
	q->data = e;
	q->next = p->next;
	p->next = q;
	return true;
}
bool ListDelete(LinkNode* &L, int i, int &e)//删除第i个数据元素
{
	LinkNode *p =L;
	int j = 1;
	while (p != NULL && j < i)
	{
		p = p->next;
		j++;
	}
	LinkNode *q;
	q = p->next;
	e = q->data;
	p->next=q->next;
	free(q); return true;
}
void split(LinkNode *&L, LinkNode *&L1, LinkNode *&L2)//将链表分裂成连个p52,没书上写得好split[splɪt]vt.	分裂; 分开
{
	LinkNode *p = L->next,*q,*r;
	r = L1;
	while (p != NULL)
	{
		q = (LinkNode*)malloc(sizeof(LinkNode));
		r->next = q;
		q->data = p->data;
		q->next = NULL;
		r = q;
		p = p->next->next;
	}
	r = L2;
	p = L->next->next;
	while (p != NULL)
	{
		q = (LinkNode*)malloc(sizeof(LinkNode));
		q->next = r->next;
		r->next = q; 
		q->data = p->data;
		p = p->next;
		if (p == NULL)
			break;
		else
			p=p->next;
	}
}
void delmaxnode(LinkNode *&L)//删除单链表中最大的元素
{
	LinkNode *p = L->next, *pre = L, *maxp = p, *maxpre = pre;
	while (p != NULL)
	{
		if (p->data > maxp->data)
		{
			maxp = p;
			maxpre = pre;
		}pre = p;
		p = p->next;
	}
	maxpre->next = maxpre->next->next;
	free(maxp);
}
void sort(LinkNode *&L)//把链表从小到大排序
{
	//交给以后。。
}
int main()
{
	int a[] = { 6,2,5,7,8,3,5,8,9,4 };
	LinkNode* L,*L1,*L2;
	int e; InitList(L1); InitList(L2);
	CreateListF(L,a,10);DispList(L);
	printf("单链表元素个数为：%d\n", ListLength(L));
	DestroyList(L);
	CreateListR(L, a, 10);DispList(L);	
	printf("单链表元素个数为：%d\n", ListLength(L));
	Getint(L, 3, e);
	printf("第3个元素为%d\n", e);
	printf("数字8在第%d\n", Locateint(L, 8));
	ListInsert(L, 3, 99); DispList(L);
	ListDelete(L, 3, e);
	printf("删除了%d\n", e);
	split(L, L1, L2);
	DispList(L1); DispList(L2);
	delmaxnode(L); 
	DispList(L);
	system("pause");
	return 0;
}