双链表--C++语言实现

1.doubleLinkList.h文件

#pragma once

#include<iostream>

template<typename DataType>

struct Lnode
{
	DataType data;
	struct Lnode* front;
	struct Lnode* rear;
};

template<typename DataType>
class DoubleLinkList
{
public:
	DoubleLinkList();   //无参构造
	DoubleLinkList(DataType a[], int n);   //有参构造
	~DoubleLinkList();           //析构函数
	int doubleLinkListLength();
	bool doubleLinkListEmpty();
	DataType getValue(int i);   //获取第i个位置的链表值
	int locateIndex(DataType data);  //获取值为x的元素在链表中的位置
	void insertDoubleLinkList(int pos, DataType data);  //插入元素
	DataType deleteDoubleLinkList(int pos);   //删除元素，并返回删除的值
	void printDoubleLinkList();    //打印链表
private:
	Lnode<DataType>* head, * tail;   //头结点和尾结点
};

2.doubleLinkList.cpp文件

#include<iostream>
#include"doubleLinkList.h"

using namespace std;


//链表无参构造初始化
template<typename DataType>
DoubleLinkList<DataType>::DoubleLinkList()
{
	head = new Lnode<DataType>;
	head->rear = NULL;
}

//链表有参构造初始化
template<typename DataType>
DoubleLinkList<DataType>::DoubleLinkList(DataType a[], int n)
{
	head = new Lnode<DataType>;
	tail = new Lnode<DataType>;
	//初始化时，头结点的后指针和尾结点的前指针都应该指向为空
	tail->front = NULL;   
	head->rear = NULL;
	Lnode<DataType>* p = head;
	Lnode<DataType>* q = NULL;
	for (int i = 0; i < n; i++)
	{
		q = new Lnode<DataType>;
		q->data = a[i];
		q->front = tail->front;
		tail->front = q;
		p->rear = q;
		p = q;
	}
	p->rear = NULL; //结点创建完毕，让终止结点的指针域为空
}

template<typename DataType>
DoubleLinkList<DataType>::~DoubleLinkList()
{
	Lnode<DataType>* p = NULL;
	while (head != NULL)
	{
		p = head;
		head = head->rear;
		delete p;
	}
	cout << "结点删除完毕" << endl;
}

template<typename DataType>
bool DoubleLinkList<DataType>::doubleLinkListEmpty()
{
	if (head->rear == NULL)
	{
		return true;
	}
	return false;
}


//求链表的长度
template<typename DataType>
int DoubleLinkList<DataType>::doubleLinkListLength()
{
	Lnode<DataType>* p = head->rear;
	int count = 0;
	while (p != NULL)
	{
		p = p->rear;
		count++;
	}
	return count;
}

//遍历链表
template<typename DataType>
void DoubleLinkList<DataType>::printDoubleLinkList()
{
	Lnode<DataType>* p = head->rear;
	while (p != NULL)
	{
		cout << p->data << " ";
		p = p->rear;
	}
	cout << endl;
	cout << "链表遍历完毕" << endl;
}

//根据索引值获取链表的值
template<typename DataType>
DataType DoubleLinkList<DataType>::getValue(int pos)
{
	Lnode<DataType>* p = head->rear;
	int count = 1;
	while (p != NULL && count < pos)
	{
		p = p->rear;
		count++;
	}
	if (p == NULL) throw "位置";
	else return p->data;
}

//根据值来获取索引位置
template<typename DataType>
int DoubleLinkList<DataType>::locateIndex(DataType data)
{
	Lnode<DataType>* p = head->rear;
	int count = 1;
	while (p != NULL)
	{
		if (p->data == data)
		{
			return count;
		}
		p = p->rear;
		count++;
	}
	return 0;
}

//插入结点
template<typename DataType>
void DoubleLinkList<DataType>::insertDoubleLinkList(int pos, DataType data)
{
	Lnode<DataType>* p = head->rear;
	Lnode<DataType>* q = NULL;
	int count = 1;
	//找到待插入位置的前一个结点
	while (p != NULL && count < pos - 1)
	{
		p = p->rear;
		count++;
	}
	if (p == NULL) throw "位置";
	else
	{
		q = new Lnode<DataType>;  //插入的结点
		q->data = data;
		q->rear = p->rear;
		p->rear = q;
		p->rear->front = q;
		q->front = p;
	}
}


//删除结点, 并获取删除结点的值
template<typename DataType>
DataType DoubleLinkList<DataType>::deleteDoubleLinkList(int pos)
{
	Lnode<DataType>* p = head->rear;
	Lnode<DataType>* q = NULL;
	int count = 1;
	DataType x;
	while (p != NULL && count < pos - 1)
	{
		p = p->rear;
		count++;
	}
	if (p == NULL) throw "位置";
	else
	{
		q = p->rear;
		x = q->data;  //暂存删除结点的值
		p->rear = q->rear;
		q->rear->front = p;
		delete q;
		return x;
	}
}

3.测试代码--双链表

#include<iostream>
#include"doubleLinkList.h"
//#include"doubleLinkList.cpp"  //防止模板分文件编写的错误

#include"doubleLinkList.cpp"

using namespace std;

void test01()
{
	int r[5] = { 1,2,3,4,5 };
	DoubleLinkList<int> doubleList = { r, 5 };
	cout << "当前线性表中的数据为:" << endl;
	doubleList.printDoubleLinkList();
	try
	{
		doubleList.insertDoubleLinkList(2, 8);
		cout << "执行插入操作后的数据为:" << endl;
		doubleList.printDoubleLinkList();
	}
	catch (char* str)
	{
		cout << str << endl;
	}
	cout << "当前链表的长度为:" << doubleList.doubleLinkListLength() << endl;
	cout << "请输入需要查找元素的值:" << endl;
	int data;
	cin >> data;
	int i = doubleList.locateIndex(data);
	if (i < 1)
	{
		cout << "单链表中没有该元素" << endl;
	}
	else
	{
		cout << "元素:" << data << "在链表中的位置是:" << i << endl;
	}
	try
	{
		int pos;
		cout << "请输入需要删除元素的位置:" << endl;
		cin >> pos;
		doubleList.deleteDoubleLinkList(pos);
		cout << "执行删除操作后的链表元素为:" << endl;
		doubleList.printDoubleLinkList();
	}
	catch (char* str)
	{
		cout << str << endl;
	}
}

int main()
{
	test01();
	system("pause");
	return 0;
}