08-带哨兵位双向循环链表

List.h

#pragma once
#include <stdio.h>
#include<assert.h>
#include<stdlib.h>

typedef int LTDataType;

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

//void ListInit(ListNode** phead);
ListNode* ListInit();
void ListClear(ListNode* phead);
void ListDestory(ListNode** phead);

void ListPushBack(ListNode* phead, LTDataType x);
ListNode* BuyListNode(LTDataType x);
void ListPrint(ListNode* phead);
void ListPopBack(ListNode* phead);
void ListPushFront(ListNode* phead,LTDataType x);
void ListPopFront(ListNode* phead);
void ListFind(ListNode* phead, LTDataType x);
void ListInsert(ListNode* pos, LTDataType x);
void ListErase(ListNode* pos);

List.c

#include "List.h"

ListNode* BuyListNode(LTDataType x) //
{
	ListNode* node = (ListNode*)malloc(sizeof(ListNode));
	node->next = NULL;
	node->prev = NULL;
	node->data = x;

	return node;
}

//void ListInit(ListNode** pphead)
//{
//	*pphead = BuyListNode(0);
//	(*pphead)->next = *pphead;
//	(*pphead)->prev = *pphead;
//
//}

ListNode* ListInit() //
{
	ListNode*phead = BuyListNode(0);
	phead->next = phead;
	phead->prev = phead;

	return phead;
}

void ListPrint(ListNode* phead)//
{
	assert(phead);
	ListNode* cur = phead->next;
	while (cur != phead)
	{
		printf("%d ", cur->data);
		cur = cur->next;
	}
	printf("\n");
}


void ListPushBack(ListNode* phead, LTDataType x) //
{
	/*assert(phead);

	ListNode* tail = phead->prev;
	ListNode* newnode = BuyListNode(x);

	tail->next = newnode;
	newnode->prev = tail;

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

	ListInsert(phead, x);
}

void ListPopBack(ListNode* phead)
{
	//assert(phead);
	//assert(phead->next!=phead);

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

	//tailPrev->next = phead;
	//phead->prev = tailPrev;
	//free(tail);
	//tail=NULL;
	ListErase(phead->prev);
}


void ListPushFront(ListNode* phead, LTDataType x)
{
	/*assert(phead);

	ListNode* first = phead->next;
	ListNode* newnode = BuyListNode(x);

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

	first->prev = newnode;
	newnode->next = first;*/
	ListInsert(phead->next,x);


}
void ListPopFront(ListNode* phead)
{
	/*assert(phead);
	assert(phead->next != phead);

	ListNode* first = phead->next;
	ListNode* second = first->next;

	phead->next = second;
	second->prev = phead;*/
	ListErase(phead->next);
}

void ListFind(ListNode* phead, LTDataType x)
{
	assert(phead);
	ListNode* cur = phead->next;
	while (cur != phead)
	{
		if (cur->data = x)
			return cur;

		cur = cur->next;
	}
	return NULL;
}


void ListInsert(ListNode* pos, LTDataType x)
{
	assert(pos);
	ListNode* posPrev = pos->prev;
	ListNode* newnode = BuyListNode(x);

	posPrev->next = newnode;
	newnode->prev = posPrev;
	newnode->next = pos;
	pos->prev = newnode;
}
void ListErase(ListNode* pos)
{
	assert(pos);
	ListNode* posPrev = pos->prev;
	ListNode* posNext = pos->next;

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

void ListClear(ListNode* phead)
{
	assert(phead);
	ListNode* cur = phead->next;
	while (cur != phead)
	{
		ListNode* next = cur->next;
		free(cur);
		cur = next;
	}

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

}

void ListDestory(ListNode** pphead)
{
	assert(*pphead);
	ListClear(*pphead);
	free(*pphead);
}

test.c

#define _CRT_SECURE_NO_WARNINGS
#include "List.h"

void TestList1()//
{
	/*ListNode* phead = NULL;
	ListInit(&phead);*/

	ListNode* phead = ListInit();
	ListPushBack(phead, 1);
	ListPushBack(phead, 2);
	ListPushBack(phead, 3);
	ListPushBack(phead, 4);

	ListPrint(phead);

	ListPopBack(phead);
	ListPrint(phead);

	ListPopFront(phead);
	ListPrint(phead);

	ListPushFront(phead, 8);
	ListPrint(phead);
}

int main() 
{
	 TestList1();
	return 0;
}

ListPopBack(phead);
ListPrint(phead);

ListPopFront(phead);
ListPrint(phead);

ListPushFront(phead, 8);
ListPrint(phead);

}

int main()
{
TestList1();
return 0;
}

[外链图片转存中...(img-Jb2k8NsB-1721576432403)]