数据结构之单链表

最新推荐文章于 2023-09-18 19:54:36 发布

C2395850595

最新推荐文章于 2023-09-18 19:54:36 发布

阅读量316

点赞数

文章标签：数据结构链表

本文链接：https://blog.csdn.net/C2395850595/article/details/124501909

版权

这篇博客介绍了单链表的基本概念，提供了单链表的C语言实现，包括初始化、打印、取值、插入和删除等操作。代码详细解释了每个功能的实现步骤，并通过测试案例展示了单链表的动态操作，如添加字符、删除字符和在指定位置插入字符。

摘要由CSDN通过智能技术生成

一、单链表的定义：

单链表是一种链式存取的数据结构，用一组地址任意的存储单元存放线性表中的数据元素。链表中的数据是以结点来表示的，每个结点的构成：元素(数据元素的映象) + 指针(指示后继元素存储位置)，元素就是存储数据的存储单元，指针就是连接每个结点的地址数据。

二、代码功能：

1.设置单链表

2.初始化单链表

3.打印单链表

4.单链表的取值

5.单链表的插入：

6.单链表的删除：

7.测试单链表的取值、删除、插入、打印

8.程序入口

9.运行结果

三、单链表代码：

1.设置单链表：

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

2.初始化单链表：

LinkList initLinkList()
{
	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;
	
	// Step 1.Construct a new node.
	q = (NodePtr)malloc(sizeof(LNode));
	q->data = paraChar;
	q->next = NULL;
	
	// Step 2. Search to the tail.
	p = paraHeader;
	while (p->next != NULL)
	{
		p = p->next;
	}
	
	// Step 3. Now add/link.
	p->next = q;
}

5.单链表的插入：

void insertElement(NodePtr paraHeader, char paraChar,int paraPosition)
{
	NodePtr p, q;
	
	// Step 1. Search to the position.
	p = paraHeader;
	for (int i = 0;i < paraPosition; i ++)
	{
		p = p->next;
		if(p == NULL)
		{
			printf("The position %d is beyond the scope of the list.",paraPosition);
			return;
		}
	}

单链表的插入图解：

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("Cannot delete %c\r\n",paraChar);
		return;
	}
	
	q = p->next;
	p->next = p->next->next;
	free(q);
}

单链表的删除图解：

7.测试单链表的取值、删除、插入、打印：

void appendInsertDeleteTest()
{
	// Step 1. Initialize an empty list.
	LinkList tempList = initLinkList();
	printList(tempList);
	
	// Step 2. Add some characters.
	appendElement(tempList, 'H');
	appendElement(tempList, 'e');
	appendElement(tempList, 'l');
	appendElement(tempList, 'l');
	appendElement(tempList, 'o');
	appendElement(tempList, '!');
	printList(tempList);
	
	// Step 3. Delete some characters (the first occurrence).
	deleteElement(tempList,'e');
	deleteElement(tempList,'a');
	deleteElement(tempList,'o');
	printList(tempList);
	
	// Step 4. Insert to a given position.
	insertElement(tempList,'o',1);
	printList(tempList);
}

8.程序入口：

int main()
{
	appendInsertDeleteTest();
}

9.运行结果：


Hello!
Cannot delete a
Hll!
linking
Holl!

--------------------------------
Process exited after 0.02147 seconds with return value 0

四、整体代码：

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

/**
 * Linked list of characters. The key is data.
 */

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

/**
 * Initialize the list with a header.
 * @return The pointer to the header.
 */
LinkList initLinkList()
{
	NodePtr tempHeader = (NodePtr)malloc(sizeof(LNode));
	tempHeader->data = '\0';
	tempHeader->next = NULL;
	return tempHeader;
}// of initLinkList

/**
 * Print the list.
 * @param paraHeader The header of the list.
 */
void printList(NodePtr paraHeader)
{
	NodePtr p = paraHeader->next;
	while(p != NULL)
	{
		printf("%c",p->data);
		p = p->next;
	}
	printf("\r\n");
}// of printfList

/**
 * Add an element to the tail.
 * @param paraHeader The header of the list.
 * @param paraChar The given char.
 */

void appendElement(NodePtr paraHeader, char paraChar)
{
	NodePtr p,q;
	
	// Step 1.Construct a new node.
	q = (NodePtr)malloc(sizeof(LNode));
	q->data = paraChar;
	q->next = NULL;
	
	// Step 2. Search to the tail.
	p = paraHeader;
	while (p->next != NULL)
	{
		p = p->next;
	}
	
	// Step 3. Now add/link.
	p->next = q;
}

/**
 * Insert an element to the given position.
 * @param paraHeader The header of the list.
 * @param paraChar The given char.
 * @param paraPosition The given position.
 */
void insertElement(NodePtr paraHeader, char paraChar,int paraPosition)
{
	NodePtr p, q;
	
	// Step 1. Search to the position.
	p = paraHeader;
	for (int i = 0;i < paraPosition; i ++)
	{
		p = p->next;
		if(p == NULL)
		{
			printf("The position %d is beyond the scope of the list.",paraPosition);
			return;
		}
	}
	// Step 2. Construct a new node.
	q = (NodePtr)malloc(sizeof(LNode));
	q = (NodePtr)malloc(sizeof(LNode));
	q->data = paraChar;
	
	// Step 3. Now link.
	printf("linking\r\n");
	q->next = p->next;
	p->next = q;
}// of insertElement

/**
 * Delete an element from the list.
 * @param paraHeader The header of the list.
 * @param paraChar The given char.
 */
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("Cannot delete %c\r\n",paraChar);
		return;
	}
	
	q = p->next;
	p->next = p->next->next;
	free(q);
}

/**
 * Unit test.
 */
void appendInsertDeleteTest()
{
	// Step 1. Initialize an empty list.
	LinkList tempList = initLinkList();
	printList(tempList);
	
	// Step 2. Add some characters.
	appendElement(tempList, 'H');
	appendElement(tempList, 'e');
	appendElement(tempList, 'l');
	appendElement(tempList, 'l');
	appendElement(tempList, 'o');
	appendElement(tempList, '!');
	printList(tempList);
	
	// Step 3. Delete some characters (the first occurrence).
	deleteElement(tempList,'e');
	deleteElement(tempList,'a');
	deleteElement(tempList,'o');
	printList(tempList);
	
	// Step 4. Insert to a given position.
	insertElement(tempList,'o',1);
	printList(tempList);
}
/**
 * The entrance.
 */
int main()
{
	appendInsertDeleteTest();
}