数据结构--双链表

因为理解能力较差所以课后找大佬辅导了一番，已经理解了双链表的作用和结构并且能使用双链表进行操作

基础函数的实现

#include <stdio.h>
#include <malloc.h>
 
typedef struct DoubleLinkedNode
{
	char data;
	struct DoubleLinkedNode *previous;
	struct DoubleLinkedNode *next;	
}DLNode,*DLNodePtr;
 
/*初始化一个头节点*/ 
DLNodePtr initLinkList()
{
	DLNodePtr tempHeader = 	(DLNodePtr)malloc(sizeof(struct DoubleLinkedNode));
	tempHeader->data = '\0';
	tempHeader->previous = NULL;
	tempHeader->next = NULL;
	return tempHeader;
}
 
/*打印数据*/ 
void printList(DLNodePtr paraHeader)
{
	DLNodePtr p = paraHeader->next;
	int i=0;
	while(p != NULL)
	{
		printf("%c", p->data);
		p = p->next;
		i++;	
	}
	if(i == 0)
	{
		printf("打印打印打印，打印不出来呀！"); 
	}
	printf("\r\n");	
}

尾部打印函数

void tailPrintList (DLNodePtr paraHeader)
{
	DLNodePtr p = paraHeader->next;
	while(p->next != NULL)
	{
		p = p->next;
	}
	
	while(p != NULL)
	{
		printf("%c", p->data);
		p = p->previous;
	}
	printf("0***\r\n");
}

增加和删除函数

增加函数

void insertElement(DLNodePtr paraHeader,char paraChar,int paraPosition)
{
	DLNodePtr p,q,r;
	
	//1.首先要找到对应的位置
	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;
		}
	 }
	 
	 //2.其次输入新元素
	q = (DLNodePtr)malloc(sizeof(struct DoubleLinkedNode));
	q->data = paraChar;
	
	//3.最后连接
	r = p->next;
	q->next = p->next;
	q->previous = p;
	p->next = q;
	if(r != NULL)
	{
		r->previous = q;
	 } 
}

示意图展示

删除

//删除元素
void deleteElement(DLNodePtr paraHeader, char paraChar)
{
	DLNodePtr p,q,r;
	p = paraHeader;
	
	//步骤一：定位
	while ((p->next != NULL) && (p->next->data != paraChar))
	{
		p = p->next;
	}
	
	//报错
	if (p->next == NULL)
	{
		printf("The char '%c' does not exit.\r\n",paraChar);
		return;
	}
	
	//更换
	q = p->next;
	r = q->next;
	p->next = r;
	if(r != NULL)
	{
		r->previous = p;//错误位置 
	}
	
	free(q); 
}

测试函数

 

void insertDeleteTest()
{
	DLNodePtr tempList = initLinkList();
	printList(tempList);
	
	insertElement(tempList, 'o', 0);
	insertElement(tempList, 'm', 1);
	insertElement(tempList, 'o', 2);
	insertElement(tempList, 'm', 3);
	insertElement(tempList, 'O', 4);
	printList(tempList);
	tailPrintList(tempList);
	
	deleteElement(tempList, 'm');
	printList(tempList);
	deleteElement(tempList, 'E');
	printList(tempList);
	deleteElement(tempList, 'O');
	printList(tempList);
	
	tailPrintList(tempList);
}