线性表-双链表

最新推荐文章于 2024-08-05 17:54:35 发布

Perry.Peng

最新推荐文章于 2024-08-05 17:54:35 发布

阅读量40

点赞数

分类专栏：数据结构文章标签： c++ 算法数据结构

本文链接：https://blog.csdn.net/qq_43113326/article/details/129332476

版权

数据结构专栏收录该内容

6 篇文章 0 订阅

订阅专栏

这篇文章展示了如何使用C++创建一个链表结构，包括初始化链表、在头部插入节点、在尾部插入节点以及根据数据删除节点的方法。代码中定义了一个结构体Node，然后提供了相应的链表操作函数，最后通过main函数进行测试。

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

#include <iostream>
#include <list>
using namespace std;
struct Node
{
	int data;
	Node* next;
	Node* pre;
};

Node* initList()
{
	Node* node = (Node*)malloc(sizeof(Node));
	node->data = 0;
	node->next = nullptr;
	node->pre = nullptr;
	return node;
}

void headInsert(Node* list, int data)
{
	Node* node = (Node*)malloc(sizeof(Node));
	node->data = data;
	node->next = list->next;
	node->pre = list;
	list->next = node;
	if(node->next)
		node->next->pre = node;

	list->data++;
}

void tailInsert(Node* list, int data)
{
	Node* head = list;
	list->data++;

	Node* node = (Node*)malloc(sizeof(Node));
	node->data = data;
	node->next = nullptr;

	while (list->next!=nullptr)
	{
		list = list->next;
	}
	list->next = node;
	node->pre = list;
}

void remove(Node* list, int data)
{
	Node* head = list;

	Node* cur = list->next;
	Node* temp = nullptr;
	while (cur!=nullptr)
	{
		if (cur->data == data)
		{
			cur->pre->next = cur->next;
			cur->next->pre = cur->pre;
			temp = cur;
			cur = cur->next;
			free(temp);
			head->data--;
		}
		else {
			
			cur = cur->next;
		}

	}
}

void printList(Node* node)
{
	cout << "size:" << node->data << endl;
	Node* head = node;
	while (node->next!=nullptr)
	{
		node = node->next;
		cout << node->data << endl;
	}
	cout << "null" << endl;
}

int main()
{
	Node* list = initList();
	headInsert(list, 1);
	headInsert(list, 2);
	headInsert(list, 3);
	headInsert(list, 4);
	headInsert(list, 5);
	headInsert(list, 3);
	tailInsert(list, 6);
	tailInsert(list, 6);
	tailInsert(list, 7);
	tailInsert(list, 8);
	tailInsert(list, 9);
	tailInsert(list, 10);
	printList(list);

	remove(list, 3);
	remove(list, 8);
	printList(list);

}