数据结构03-双向链表

双向链表的代码

#include<iostream>
using namespace std;

/**
  * @brief  定义一个具有前驱和后继的结构体作为双链表的节点
  */
typedef struct DoubleLinkedList {
	int data;
	struct DoubleLinkedList* next;
	struct DoubleLinkedList* pre;
}DualLinkedList;

/**
  * @brief  定义一个操作双链表节点的操作类，包含初始化，插入，删除，打印（正向和反向）
  */

class DualOperator
{
public:
	/**
  * @brief  类内声明，类外定义
  */
	DualLinkedList* DualLinkedList_Init();
	void DualLinkedList_Insert(DualLinkedList*head,int pos,int data);
	void DualLinkedList_Delete(DualLinkedList*head,int data);
	void ShowList(DualLinkedList* head);
	void test();
};
/**
  * @brief  初始化一个头节点，返回地址
  * @param  无
  * @retval 返回地址
  */
DualLinkedList* DualOperator::DualLinkedList_Init()
{
	DualLinkedList* pHead = new DualLinkedList;
	if (!pHead) {
		cout << "申请内存失败" << endl;
		return NULL;
	}
	pHead->data = 0;
	pHead->next = NULL;
	pHead->pre = NULL;
	return pHead;
}
/**
  * @brief  通过位置定位在链表中插入结点
  * @param  头结点地址
  * @param  位置
  * @param  数据
  * @retval 无
  */
void DualOperator::DualLinkedList_Insert(DualLinkedList* pHead, int pos, int data)
{
	int j = 0;
	DualLinkedList* q = pHead;
	while (q != NULL && j < pos)
	{
		q = q->next;
		j++;
	}
	if (q == NULL) {
		cout << "插入位置不合法" << endl;
		return;
	}
	DualLinkedList* temp = new DualLinkedList;
	if (!temp) {
		cout << "申请内存失败！" << endl;
		return ;
	}
	if (q->next) {
		q->next->pre = temp;
	}
	temp->data = data;
	temp->next = q->next;
	q->next = temp;
	temp->pre = q;
}
/**
  * @brief  通过元素定位在链表中删除结点
  * @param  头结点地址
  * @param  数据
  * @retval 无
  */
void DualOperator::DualLinkedList_Delete(DualLinkedList* pHead, int data)
{
	DualLinkedList* q = pHead->next;
	while (q != NULL && q->data != data)
	{
		q = q->next;
	}
	if (q == NULL) {
		cout << "未找到元素" << endl;
		return;
	}
	DualLinkedList* temp = q;
	DualLinkedList* pre = q->pre;
	DualLinkedList* next = q->next;
	pre->next = next;
	next->pre = pre;
	delete temp;
	if (!temp) {
		temp = NULL;
	}
}
/**
  * @brief 打印链表
  * @param  头结点地址
  * @retval 无
  */
void DualOperator::ShowList(DualLinkedList* pHead)
{
	DualLinkedList* p = pHead;
	while (p->next!= NULL)
	{
		cout << p->next->data << " ";
		p = p->next;
	}
	cout << endl;
	while (p->pre != NULL)
	{
		cout << p->data << " ";
		p = p->pre;
	}
	cout << endl;
}
/**
  * @brief  测试函数
  * @retval 无
  */
void DualOperator::test()
{
	DualLinkedList* list = this->DualLinkedList_Init();
	this->DualLinkedList_Insert(list, 0, 1);
	this->DualLinkedList_Insert(list, 0, 2);
	this->DualLinkedList_Insert(list, 0, 3);
	this->DualLinkedList_Insert(list, 0, 4);
	this->DualLinkedList_Insert(list, 0, 5);
	this->ShowList(list);
	this->DualLinkedList_Delete(list, 4);
	this->DualLinkedList_Delete(list, 6);
	this->ShowList(list);
}

int main()
{
	DualOperator op;
	op.test();
	return 0;
}