带头双向链表实现

---

前言

带头双向链表实现

---

1.带头双向项链表实现

1.函数声明

#define _CRT_SECURE_NO_WARNINGS 1
#pragma once
#include<stdio.h>
#include<assert.h>
#include<stdlib.h>
#include <stdbool.h>
typedef int LTDataType;
typedef struct ListNode
{
	struct ListNode* prev;
	struct ListNode* next;
	LTDataType data;
}LTNode;
//新节点
LTNode* BuyListNode(LTDataType x);
//初始化链表
LTNode* LTInit();
//尾插
void LTPushBack(LTNode* phead, LTDataType x);
//尾删
void LTPopBack(LTNode* phead);
//头插
void LTPushFront(LTNode* phead, LTDataType x);
//头删
void LTPopFront(LTNode* phead);
//打印链表
void LTPrint(LTNode* phead);
//查找元素
LTNode* LTFind(LTNode* phead, LTDataType x);
//在pos前插入
void LTInsert(LTNode* pos, LTDataType x);
//删除pos
void LTErase(LTNode* pos);
//链表元素
size_t LTSize(LTNode* phead);
bool LTEmpty(LTNode* phead);、
//摧毁链表
void LTDestroy(LTNode* phead);

2.函数实现

#define _CRT_SECURE_NO_WARNINGS 1
#include"list.h"
LTNode* BuyListNode(LTDataType x)
{
	LTNode* node = (LTNode*)malloc(sizeof(LTNode));
	if (node == NULL)
	{
		perror("node");
		exit(-1);
	}
	node->data = x;
	node->next = NULL;
	node->prev = NULL;
	return node;
}
LTNode* LTInit()
{
	LTNode* phead = BuyListNode(-1);
	phead->next = phead;
	phead->prev = phead;
	return phead;
}
void LTPushBack(LTNode* phead, LTDataType x)
{
	assert(phead);
	LTNode* newnode = BuyListNode(x);
	LTNode* tail = phead->prev;
	tail->next = newnode;
	newnode->prev = tail;
	newnode->next = phead;
	phead->prev = newnode;
}
void LTPopBack(LTNode* phead)
{
	assert(phead);
	assert(phead->next != phead);
	LTNode* tail = phead->prev;
	LTNode* tailprev = tail->prev;
	tailprev->next = phead;
	phead->prev = tailprev;
	free(tail);
}
void LTPushFront(LTNode* phead, LTDataType x)
{
	assert(phead);
	LTNode* newnode = BuyListNode(x);
	LTNode* first = phead->next;
	phead->next = newnode;
	newnode->prev = phead;
	newnode->next = first;
	first->prev = newnode;
}
void LTPopFront(LTNode* phead)
{
	assert(phead);
	assert(phead->next);
	LTNode* first = phead ->next;
	LTNode* second = first->next;
	phead->next = second;
	second->prev = phead;
	free(first);

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

}
LTNode* LTFind(LTNode* phead, LTDataType x)
{
	assert(phead);
	LTNode* cur = phead->next;
	while (cur->next != phead)
	{
		if (cur->data == x)
		{
			return cur;
		}
		cur = cur->next;
	}
	return NULL;

}
void LTInsert(LTNode* pos, LTDataType x)
{
	assert(pos);
	LTNode* prev = pos->prev;
	LTNode* newnode = BuyListNode(x);
	prev->next = newnode;
	newnode->prev = prev;
	newnode->next = pos;
	pos->prev = newnode;

}
void LTErase(LTNode* pos)
{
	assert(pos);
	LTNode* prev = pos->prev;
	LTNode* next = pos->next;
	free(pos);
	prev->next = next;
	next->prev = prev;

}
bool LTEmpty(LTNode* phead)
{
	assert(phead);
    return phead->next == phead;
}
size_t LTSize(LTNode* phead)
{
	assert(phead);
	size_t size = 0;
	LTNode* cur = phead->next;
	while (cur != phead)
	{
		++size;
		cur = cur->next;
	}
	return size;
}
void LTDestroy(LTNode* phead)
{
	assert(phead);
	LTNode* cur = phead->next;
	while (cur != phead)
	{
		LTNode* next = cur->next;
		free(cur);
		cur = next;
	}
	free(phead);
}

3.主函数

#include"list.h"-
int main()
{
	LTNode* phead = LTInit();
	//LTPushBack(phead, 8);
	//LTPopBack(phead);
	LTPushFront(phead, 1);
	LTPushFront(phead, 2);
	LTPushFront(phead, 3);
	LTPushFront(phead, 4);
	LTPushFront(phead, 5);
	LTPushFront(phead, 6);
	LTPushFront(phead, 7);
	LTPushFront(phead, 8);
	LTPushFront(phead, 9);
	LTPushFront(phead, 10);
	LTNode* p=LTFind(phead, 8);
	LTInsert(p, 8);
	LTErase(p);
	size_t s= LTSize(phead);
	//LTDestroy(phead);
	//LTPopFront(phead);
	LTPrint(phead);
	printf("%d", s);
	
}