数据结构之双向循环链表(参考整理严蔚敏数据结构)

最新推荐文章于 2024-11-25 10:09:59 发布

原创最新推荐文章于 2024-11-25 10:09:59 发布 · 623 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#数据结构双向循环链表基本操作

数据结构专栏收录该内容

57 篇文章

订阅专栏

本文介绍了一个双向链表的数据结构实现及其基本操作，包括初始化、销毁、清空、判断是否为空、获取长度、插入和删除节点等。通过具体示例展示了如何使用这些函数进行双向链表的操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<iostream>
using namespace std;

typedef int ElemType;
typedef struct DNode
{
	ElemType data;
	DNode *pPrior;
	DNode *pNext;
}DNode;
typedef DNode * DLink;

void InitList(DLink &L)
{
	L = new DNode;
	L->pNext = L->pPrior = L;
}

void DestroyList(DLink &L)
{
	DLink q = NULL, p = L->pNext;
	while (p != L)
	{
		q = p->pNext;
		delete p;
		p = q;
	}
	delete L;
	L = NULL;
}

void ClearList(DLink &L)
{
	DLink q, p = L->pNext;
	while (p != L)
	{
		q = p->pNext;
		delete p;
		p = q;
	}
	L->pNext = L->pPrior = L;
}

bool ListEmpty(DLink L)
{
	if (L->pNext == L&&L->pPrior == L)
		return true;
	else
		return false;
}

int ListLength(DLink L)
{
	int i = 0;
	DLink p = L->pNext;
	while (p != L)
	{
		++i;
		p = p->pNext;
	}
	return i;
}

bool GetElem(DLink L, int pos, ElemType &e)
{
	int i = 1;
	DLink p = L->pNext;
	while (p != L&&i < pos)
	{
		p = p->pNext;
		++i;
	}
	if (p == L || i > pos)
		return false;
	else
	{
		e = p->data;
		return true;
	}
}

DLink GetElemP(DLink L, int pos)
{
	int i;
	DLink p = L;
	for (i = 1; p&&i <= pos; ++i)
		p = p->pNext;
	return p;
}

int LocateElem(DLink L, ElemType e)
{
	int i = 0;
	DLink p = L->pNext;
	while (p != L)
	{
		++i;
		if (e == p->data)
			return i;
		else
			p = p->pNext;
	}
	return 0;
}

bool PriorElem(DLink L, ElemType cur_e, ElemType &pre_e)
{//cur_e从第二个开始
	DLink p = L->pNext;
	if (p != L)
	{
		p = p->pNext;//if(p!=L),则p指向第二个元素
		while (p != L)
		{
			if (p->data == cur_e)
			{
				pre_e = p->pPrior->data;
				return true;
			}
			p = p->pNext;
		}
	}
	return false;
}

bool NextElem(DLink L, ElemType cur_e, ElemType &next_e)
{//cur_e不能是最后一个
	DLink p = L->pNext;
	if (p != L)
	{
		p = p->pNext;//p有第二个开始
		while (p != L)
		{
			if (p->pPrior->data == cur_e)
			{
				next_e = p->data;
				return true;
			}
			else
				p = p->pNext;
		}
	}
	return false;
}

bool ListInsert(DLink L, int pos, ElemType e)
{
	DLink p, q;
	if (pos<1 || pos>ListLength(L)+1)
		return false;
	else
	{
		p = GetElemP(L, pos - 1);//定位第pos-1个位置的结点
		if (!p)
			return false;
		q = new DNode;
		q->data = e;
		q->pPrior = p;
		q->pNext = p->pNext;
		p->pNext->pPrior = q;
		p->pNext = q;
		p = q = NULL;
		return true;
	}
}

bool ListDelete(DLink L, int pos, ElemType &e)
{
	DLink p;
	if (pos<1 || pos>ListLength(L))
		return false;
	p = GetElemP(L, pos);//定位pos位置的结点
	if (!p)
		return false;
	e = p->data;
	p->pPrior->pNext = p->pNext;
	p->pNext->pPrior = p->pPrior;
	delete p;
	p = NULL;
	return true;
}

void ListPrintDe(DLink L)
{
	DLink p = L->pPrior;
	while (p != L)
	{
		cout << p->data << " ";
		p = p->pPrior;
	}
	cout << endl;
}

void ListPrintAs(DLink L)
{
	DLink p = L->pNext;
	while (p != L)
	{
		cout << p->data << " ";
		p = p->pNext;
	}
	cout << endl;
}


int main(void)
{
	DLink L;
	ElemType e;
	InitList(L);
	ListInsert(L, 1, 1);
	ListInsert(L, 2, 2);
	ListInsert(L, 3, 3);
	ListInsert(L, 4, 4);
	ListInsert(L, 5, 5);
	ListInsert(L, 6, 6);
	ListInsert(L, 7, 7);
	ListPrintAs(L);
	GetElem(L, 2, e);
	cout << e << endl;
	ListDelete(L, 7, e);
	cout << e << endl;
	ListPrintAs(L);
	ListPrintDe(L);
	cout << LocateElem(L, 3)<<endl;
	PriorElem(L, 2, e);
	cout << e << endl;
	NextElem(L, 2, e);
	cout << e << endl;
	return(0);
}