双向链表（作业）

最新推荐文章于 2024-11-09 19:15:00 发布

路飞的折耳根

最新推荐文章于 2024-11-09 19:15:00 发布

阅读量232

点赞数 2

文章标签：链表数据结构算法

本文链接：https://blog.csdn.net/shidaorujin33/article/details/138034098

版权

本文介绍了如何使用C语言实现双链表数据结构，包括初始化头节点、打印列表、在指定位置插入元素、删除特定字符以及基本地址测试。示例展示了完整的操作流程和运行结果。

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

1.代码

#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("\n");
}
void insertElement(DLNodePtr paraHeader, char paraChar, int paraPosition) {
	DLNodePtr p, q, r;
	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;
		}
	}
	q = (DLNodePtr)malloc(sizeof(struct DoubleLinkedNode));
	q->data = paraChar;
	r = p->next;
	q->next = r;
	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 exist\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, '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\n",
		&tempNode1, &tempNode1.data, &tempNode1.next);
	printf("the second node:%d,%d,%d\n",
		&tempNode2, &tempNode2.data, &tempNode2.next);
	tempNode1.next = &tempNode2;
}

int main() {
	insertDeleteTest();
	basicAddressTest();
	return 0;
}

2.图像