2.3双向链表
1.定义结构体
typedef struct DoubleLinkedNode
{
char data;
struct DoubleLinkedNode* previous;
struct DoubleLinkedNode* next;
}DLNode,*DLNodePtr;
2.初始化
DLNodePtr initLinkList()
{
DLNodePtr tempHeader = (DLNodePtr)malloc(sizeof(struct DoubleLinkedNode));
tempHeader->data = '\0';
tempHeader->previous = NULL;
tempHeader->next = NULL;
return tempHeader;
}
3.打印
void printList(DLNodePtr paraHeader)
{
DLNodePtr p = paraHeader->next;
while (p != NULL)
{
printf("%c", p->data);
p = p->next;
}
printf("\r\n");
}
4.插入
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("所给位置超出最大范围");
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;
}
}
5.删除
void deleteElement(DLNodePtr paraHeader, char paraChar)
{
DLNodePtr p, q, r;
p = paraHeader;
//1.确定算删除元素的位置
while ( (p->next != NULL)&& (p->next->data != paraChar))
{
p = p->next;
}
//2.如果没找到,就返回
if (p->next == NULL)
{
printf("没找到");
return;
}
//3.删除结点
q = p->next;
r = q->next;
p->next = r;
if (r != NULL) {
r->previous = p;
}
//4.释放空间
free(q);
}
6.插入删除测试
void insertDeleteTest() {
// 创建一个结点
DLNodePtr tempList = initLinkList();
printList(tempList);
// 添加结点.
insertElement(tempList, 'H', 0);
insertElement(tempList, 'e', 1);
insertElement(tempList, 'l', 2);
insertElement(tempList, 'l', 3);
insertElement(tempList, 'o', 4);
insertElement(tempList, '!', 5);
printList(tempList);
// 删除结点
deleteElement(tempList, 'e');
deleteElement(tempList, 'a');
deleteElement(tempList, 'o');
printList(tempList);
//再次添加
insertElement(tempList, 'o', 1);
printList(tempList);
}
7.地址测试
void basicAddressTest() {
DLNode tempNode1, tempNode2;
tempNode1.data = 4;
tempNode1.next = NULL;
tempNode2.data = 6;
tempNode2.next = NULL;
printf("The first node: %d, %d, %d\r\n",
&tempNode1, &tempNode1.data, &tempNode1.next);
printf("The second node: %d, %d, %d\r\n",
&tempNode2, &tempNode2.data, &tempNode2.next);
tempNode1.next = &tempNode2;
}
8.完整代码
#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;
while (p != NULL)
{
printf("%c", p->data);
p = p->next;
}
printf("\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("所给位置超出最大范围");
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;
//1.确定算删除元素的位置
while ( (p->next != NULL)&& (p->next->data != paraChar))
{
p = p->next;
}
//2.如果没找到,就返回
if (p->next == NULL)
{
printf("没找到");
return;
}
//3.删除结点
q = p->next;
r = q->next;
p->next = r;
if (r != NULL) {
r->previous = p;
}
//4.释放空间
free(q);
}
//测试
void insertDeleteTest() {
// 创建一个结点
DLNodePtr tempList = initLinkList();
printList(tempList);
// 添加结点.
insertElement(tempList, 'H', 0);
insertElement(tempList, 'e', 1);
insertElement(tempList, 'l', 2);
insertElement(tempList, 'l', 3);
insertElement(tempList, 'o', 4);
insertElement(tempList, '!', 5);
printList(tempList);
// 删除结点
deleteElement(tempList, 'e');
deleteElement(tempList, 'a');
deleteElement(tempList, 'o');
printList(tempList);
//再次添加
insertElement(tempList, 'o', 1);
printList(tempList);
}
//地址测试
void basicAddressTest() {
DLNode tempNode1, tempNode2;
tempNode1.data = 4;
tempNode1.next = NULL;
tempNode2.data = 6;
tempNode2.next = NULL;
printf("The first node: %d, %d, %d\r\n",
&tempNode1, &tempNode1.data, &tempNode1.next);
printf("The second node: %d, %d, %d\r\n",
&tempNode2, &tempNode2.data, &tempNode2.next);
tempNode1.next = &tempNode2;
}
void main() {
insertDeleteTest();
basicAddressTest();
}
9.运行结果
Hello!
没找到Hll!
Holl!
The first node: -1865286824, -1865286824, -1865286808
The second node: -1865286776, -1865286776, -1865286760