链表基本操作的实现

代码如下：

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

#define OK 1
#define ERROR 0

typedef int ElemType, Status;

typedef struct LNode
{
	ElemType data;    //数据域
	struct LNode* next;    //指针域
}LNode, * LinkList;

typedef struct SListInfo
{
	LinkList head;    //表头指针节点
	LinkList tail;    //表尾指针节点
	LNode* pCurNode;  //当前节点指针位置
	int length;       //单链表长度
}SListInfo;

Status InitList(SListInfo& L)    //初始化单链表
{
	L.head = (LNode*)malloc(sizeof(LNode));
	if (L.head == NULL) exit(0);
	L.head->next = NULL;
	L.tail = L.head;
	L.length = 0;
	return OK;
}

Status DestroyList(SListInfo& L)    //销毁单链表
{
	LNode* p = L.head;
	LNode* q;
	while (p)
	{
		q = p;
		p = q->next;
		free(q);
	}
	L.head = NULL;
	L.length = 0;
	L.pCurNode = NULL;
	L.tail = NULL;
	return OK;
}

Status ListEmpty(SListInfo L)    //单链表判空
{
	if (L.length == 0) return OK;
	else return ERROR;
}

Status GetElem(SListInfo L, int i, ElemType& e)    //单链表元素获取
{
	if (L.length == 0) return ERROR;
	if (i < 1 || i > L.length) return ERROR;
	LNode* p = L.head->next;
	for (int j = 1; j < i; j++)
	{
		p = p->next;
	}
	e = p->data;
	return OK;
}

Status LocateElem(SListInfo L, ElemType e)    //单链表元素查找
{
	if (L.length == 0) return ERROR;
	LNode* p = L.head->next;
	int i = 1;
	while (p)
	{
		if (p->data == e) return i;
		p = p->next;
		i = i + 1;
	}
	return ERROR;
}

Status PriorElem(SListInfo L, ElemType cur_e, ElemType& pre_e)    //单链表查找前驱元素
{
	if (L.length <= 1) return ERROR;
	LNode* p = L.head->next;
	if (p->data == cur_e) return ERROR;
	LNode* q = p;
	p = q->next;
	while (p)
	{
		if (p->data == cur_e)
		{
			pre_e = q->data;
			return OK;
		}
		q->next = p;
		p->next = q->next;
	}
	return ERROR;
}

Status NextElem(SListInfo L, ElemType cur_e, ElemType& next_e)    //单链表查后继元素
{
	if (L.length <= 1) return ERROR;
	LNode* p = L.head->next;
	while (p)
	{
		if (p->data == cur_e && p->next)
		{
			next_e = p->data;
			return OK;
		}
		p = p->next;
	}
	return ERROR;
}

Status ListTraverse(SListInfo L)    //单链表遍历
{
	if (L.length == 0) return ERROR;
	LNode* p = L.head->next;
	while (p)
	{
		printf("%d ", p->data);
		p = p->next;
	}
	printf("\n");
	return OK;
}

Status InsertElem(SListInfo& L, int i, ElemType e)    //单链表插入节点
{
	if (i < 1 || i > L.length + 1) return ERROR;
	if (i == L.length + 1)    //插入到尾结点之后
	{
		LNode* p = (LNode*)malloc(sizeof(LNode));
		if (p == NULL) exit(0);
		p->data = e;
		p->next = NULL;
		L.tail->next = p;
		L.tail = p;    //移动尾指针
		L.length = L.length + 1;
		return OK;
	}
	//在尾结点之前插入
	int j = 0;
	LNode* p = L.head;
	while (j < i - 1)
	{
		p = p->next;
	}
	LNode* q = (LNode*)malloc(sizeof(LNode));
	if (q == NULL) exit(0);
	q->data = e;
	q->next = p->next;
	p->next = q;
	L.length = L.length + 1;
	return OK;
}

Status DeleteElem(SListInfo& L, int i, ElemType& e)    //单链表删除节点
{
	if (L.length == 0) return ERROR;
	if (i < 1 || i > L.length) return ERROR;
	int j = 0;
	LNode* p = L.head;
	while (j < i - 1)
	{
		p = p->next;
		j++;
	}
	if (i == L.length)    //删除的是尾结点
	{
		e = L.tail->data;
		L.tail = p;
		free(p->next);
		p->next = NULL;
		L.length = L.length - 1;
		return OK;
	}
	e = p->next->data;
	LNode* q = p->next;
	p->next = q->next;
	free(q);
	L.length = L.length - 1;
	return OK;
}

Status CreateList(SListInfo& L)    //创建单链表
{
	LNode* p = (LNode*)malloc(sizeof(LNode));
	if (p == NULL) exit(0);
	p->next = NULL;
	L.head = p;
	L.pCurNode = p;
	L.tail = p;
	L.length = 0;
	int n;    //需要创建的链表长度
	printf("链表长度:");
	scanf_s("%d", &n);
	int i = 0;
	printf("链表元素:");
	while (i < n)
	{
		ElemType e;
		scanf_s("%d", &e);
		LNode* q = (LNode*)malloc(sizeof(LNode));
		if (q == NULL) exit(0);
		q->data = e;
		q->next = NULL;
		L.pCurNode->next = q;
		L.pCurNode = q;
		L.tail = q;
		L.length = L.length + 1;
		i++;
	}
	return OK;
}

int main()
{
	SListInfo L;
	CreateList(L);
	ListTraverse(L);
	InsertElem(L, 1, 0);
	ListTraverse(L);
	InsertElem(L, 7, 6);
	ListTraverse(L);
	ElemType e;
	DeleteElem(L, 7, e);
	ListTraverse(L);
	return 0;
}

运行结果如下：