数据结构双向、循环链表的实现

链表的实现

1.双向链表的结构

typedef int LTDataType;
typedef struct ListNode
{
	struct ListNode* next;
	struct ListNode* prev;
	LTDataType data;
}LTNode;

 2.双向链表的初始化

LTNode* LTInit()
{
	LTNode* phead = BuyLTNode(-1);
	phead->next = phead;
	phead->prev = phead;

	return phead;
}

3.链表的插入

void LTInsert(LTNode* pos, LTDataType x)
{
	assert(pos);

	LTNode* prev = pos->prev;
	LTNode* newnode = BuyLTNode(x);

	// prev newnode pos
	prev->next = newnode;
	newnode->prev = prev;
	newnode->next = pos;
	pos->prev = newnode;
}

4.链表的删除

void LTErase(LTNode* pos)
{
	assert(pos);

	LTNode* posPrev = pos->prev;
	LTNode* posNext = pos->next;

	posPrev->next = posNext;
	posNext->prev = posPrev;
	free(pos);
}

链表的头插（删）、尾插（删）都可以调用上面两个函数来进行实现。这样可以避免程序中出现重复的代码，下面是头插（删）、尾插（删）具体的代码。

//头插
void LTPushBack(LTNode* phead, LTDataType x)
{
	assert(phead);

	LTInsert(phead, x);

	//LTNode* tail = phead->prev;
	//LTNode* newnode = BuyLTNode(x);

	//tail->next = newnode;
	//newnode->prev = tail;
	//newnode->next = phead;
	//phead->prev = newnode;
}


//尾插
void LTPushFront(LTNode* phead, LTDataType x)
{
	/*assert(phead);
	LTNode* newnode = BuyLTNode(x);
	LTNode* first = phead->next;

	phead->next = newnode;
	newnode->prev = phead;

	newnode->next = first;
	first->prev = newnode;*/

	LTInsert(phead->next, x);
}

//头删
void LTPopFront(LTNode* phead)
{
	assert(phead);
	assert(!LTEmpty(phead));

	LTErase(phead->next);

	//LTNode* first = phead->next;
	//LTNode* second = first->next;

	//phead->next = second;
	//second->prev = phead;

	//free(first);
}

//尾删
void LTPopBack(LTNode* phead)
{
	assert(phead);
	assert(!LTEmpty(phead));
	LTErase(phead->prev);

	/*LTNode* tail = phead->prev;
	LTNode* tailPrev = tail->prev;

	free(tail);
	tailPrev->next = phead;
	phead->prev = tailPrev;*/

}

上述被注释掉的代码即为编写插入、删除函数前的代码

5.查找函数

LTNode* LTFind(LTNode* phead, LTDataType x)
{
	assert(phead);

	LTNode* cur = phead->next;
	while (cur != phead)
	{
		if (cur->data == x)
		{
			return cur;
		}

		cur = cur->next;
	}

	return NULL;
}

6.代码中出现的其他函数

• 判断链表是否为空

• bool LTEmpty(LTNode* phead)
  {
  	assert(phead);
  
  	return phead->next == phead;
  }

• 打印链表

• void LTPrint(LTNode* phead)
  {
  	assert(phead);
  
  	printf("guard<==>");
  	LTNode* cur = phead->next;
  	while (cur != phead)
  	{
  		printf("%d<==>", cur->data);
  		cur = cur->next;
  	}
  	printf("\n");
  }
  

  7.销毁链表

• void LTDestroy(LTNode* phead)
  {
  	assert(phead);
  
  	LTNode* cur = phead->next;
  	while (cur != phead)
  	{
  		LTNode* next = cur->next;
  		free(cur);
  		cur = next;
  	}
  
  	
  	free(phead);
  }