单链表实现

今天给大家来个单链表

一.过程

1.创建结点

typedef struct LinkNode {
	char data;
	struct LinkNode* next;
}LNode, * LinkList,* NodePtr;

2.初始化结点

LinkList iniLinkList()
{
	NodePtr tempHeader = (NodePtr)malloc(sizeof(LNode));
	tempHeader->data = '/0';
	tempHeader->next = NULL;
	return tempHeader;
}

3.打印链表

void printList(NodePtr paraHeader) {
	NodePtr p = paraHeader->next;
	while (p != NULL)
	{
		printf("%c", p->data);
		p = p->next;
	}
	printf("\r\n");
}

4.尾插法

void appendElement(NodePtr paraHeader, char paraChar) {
	NodePtr p, q;

	// 创建结点
	q = (NodePtr)malloc(sizeof(LNode));
	q->data = paraChar;
	q->next = NULL;

	// 寻找结点最后一个位置
	p = paraHeader;
	while (p->next != NULL) {
		p = p->next;
	}
	//插入结点
	p->next = q;
}

5.插入结点

void insertElement(NodePtr paraHeader, char paraChar, int paraPosition)
{
	NodePtr p, q;
	//寻找插入的位置
	p = paraHeader;
	for (int i = 0; i < paraPosition; i++)
	{
		p = p->next;
		if (p == NULL)
		{
			printf("没有找到\n");
			return;
		}
	}
	//创建结点
	q = (NodePtr)malloc(sizeof(LNode));
	q->data = paraChar;
	//连接
	q->next = p->next;
	p->next = q;
}

6.删除结点

void deleteElement(NodePtr paraHeader, char paraChar)
{
	NodePtr p, q;
	p = paraHeader;
	while ((p->next != NULL) && (p->next->data != paraChar))
	{
		p = p->next;
	}
	if (p->next == NULL)
	{
		printf("不能删除\n");
		return;
	}
	q = p->next;
	p->next = p->next->next;
	free(q);
}

7.测试

void appendInsertDeleteTest() {
	// 初始化结点
	LinkList tempList = iniLinkList();
	printList(tempList);

	// 插入
	appendElement(tempList, 'H');
	appendElement(tempList, 'e');
	appendElement(tempList, 'l');
	appendElement(tempList, 'l');
	appendElement(tempList, 'o');
	appendElement(tempList, '!');
	printList(tempList);

	//删除
	deleteElement(tempList, 'e');
	deleteElement(tempList, 'a');
	deleteElement(tempList, 'o');
	printList(tempList);

	// 插入指定位置
	insertElement(tempList, 'o', 1);
	printList(tempList);
	//再次插入
	insertElement(tempList, 'q', 2);
	printList(tempList);
}

全部代码：

#include<stdio.h>
#include<malloc.h>
//创建结点
typedef struct LinkNode {
	char data;
	struct LinkNode* next;
}LNode, * LinkList,* NodePtr;
//初始化结点
LinkList iniLinkList()
{
	NodePtr tempHeader = (NodePtr)malloc(sizeof(LNode));
	tempHeader->data = '/0';
	tempHeader->next = NULL;
	return tempHeader;
}
//打印链表
void printList(NodePtr paraHeader) {
	NodePtr p = paraHeader->next;
	while (p != NULL)
	{
		printf("%c", p->data);
		p = p->next;
	}
	printf("\r\n");
}
//尾插法
void appendElement(NodePtr paraHeader, char paraChar) {
	NodePtr p, q;

	// 创建结点
	q = (NodePtr)malloc(sizeof(LNode));
	q->data = paraChar;
	q->next = NULL;

	// 寻找结点最后一个位置
	p = paraHeader;
	while (p->next != NULL) {
		p = p->next;
	}
	//插入结点
	p->next = q;
}

//插入结点
void insertElement(NodePtr paraHeader, char paraChar, int paraPosition)
{
	NodePtr p, q;
	//寻找插入的位置
	p = paraHeader;
	for (int i = 0; i < paraPosition; i++)
	{
		p = p->next;
		if (p == NULL)
		{
			printf("没有找到\n");
			return;
		}
	}
	//创建结点
	q = (NodePtr)malloc(sizeof(LNode));
	q->data = paraChar;
	//连接
	q->next = p->next;
	p->next = q;
}
//删除结点
void deleteElement(NodePtr paraHeader, char paraChar)
{
	NodePtr p, q;
	p = paraHeader;
	while ((p->next != NULL) && (p->next->data != paraChar))
	{
		p = p->next;
	}
	if (p->next == NULL)
	{
		printf("不能删除\n");
		return;
	}
	q = p->next;
	p->next = p->next->next;
	free(q);
}
void appendInsertDeleteTest() {
	// 初始化结点
	LinkList tempList = iniLinkList();
	printList(tempList);

	// 插入
	appendElement(tempList, 'H');
	appendElement(tempList, 'e');
	appendElement(tempList, 'l');
	appendElement(tempList, 'l');
	appendElement(tempList, 'o');
	appendElement(tempList, '!');
	printList(tempList);

	//删除
	deleteElement(tempList, 'e');
	deleteElement(tempList, 'a');
	deleteElement(tempList, 'o');
	printList(tempList);

	// 插入指定位置
	insertElement(tempList, 'o', 1);
	printList(tempList);
	//再次插入
	insertElement(tempList, 'q', 2);
	printList(tempList);
}
int main() {
	appendInsertDeleteTest();
}

运行结果：

Hello!
不能删除
Hll!
Holl!
Hoqll!

二.图形解释