【C】循环双向链表的基本操作，头插、头删、尾插、尾删

//double slist.h
#pragma once
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
typedef int LTDataType;
typedef struct ListNode
{
	LTDataType _data;
	struct ListNode* _next;
	struct ListNode* _prev;
}ListNode;
typedef struct List
{
	ListNode* _head;
}List;
void ListInit(List* plist);
void ListDestory(List* plist);
void ListPushBack(List* plist, LTDataType x);
//void ListPopBack(List* plist);
void ListPushFront(List* plist, LTDataType x);
void ListPopFront(List* plist);
//ListNode* ListFind(List* plist, LTDataType x);
// 在pos的前面进行插入
//void ListInsert(ListNode* pos, LTDataType x);
// 删除pos位置的节点
//void ListErase(ListNode* pos);
//void ListRemove(List* plist, LTDataType x);
void ListPrint(List* plist);
void ListPopBack(List* plist, LTDataType x);

#include"double slist.h"
//double slist.c
void ListInit(List* plist)
{
	plist->_head = (ListNode*)malloc(sizeof(ListNode));
	memset(&plist->_head->_data,0, sizeof(LTDataType));
	plist->_head->_next = plist->_head->_prev = plist->_head;
	//plist->head是头
}
void ListPushBack(List* plist, LTDataType x)
{
	//后插
	ListNode * cur = (ListNode*)malloc(sizeof(ListNode));
	cur->_data = x;
	cur->_next = plist->_head->_next;
	plist->_head->_next = cur;
	cur->_prev = plist->_head;
	 //好像有问题的样子
	plist->_head->_prev = cur;
	/*if (plist->_head->_prev == plist->_head)
	{
		plist->_head->_prev = cur;

	}*/
}
void ListPopBack(List* plist, LTDataType x)
{
	//
	ListNode *tmp = plist->_head->_prev;
	if (tmp != plist->_head)
	{
		tmp->_prev->_next = tmp->_next;
		tmp->_next->_prev = tmp->_prev;
		free(tmp);
	}

}
void ListPushFront(List* plist, LTDataType x)
{

	ListNode * cur = (ListNode*)malloc(sizeof(ListNode));
	cur->_data = x;
	plist->_head->_next->_prev = cur;
	cur->_next = plist->_head->_next;
	plist->_head->_next = cur;
	cur->_prev = plist->_head;
}
void ListPopFront(List* plist) 
{
	ListNode *tmp = plist->_head->_next;
	if (tmp != plist->_head)
	{
		tmp->_prev->_next = tmp->_next;
		tmp->_next->_prev = tmp->_prev;
		free(tmp);
	}

}
void ListPrint(List* plist)
{
	ListNode * cur ;

	for (cur = plist->_head->_next; cur != plist->_head;cur=cur->_next)
	{
		printf("%d<->", cur->_data);
 	}
	printf("NULL\n");
}

void ListDestory(List* plist)
{
	ListNode *tmp = plist->_head->_next;
	while(tmp != plist->_head)
	{
		tmp->_prev->_next = tmp->_next;
		tmp->_next->_prev = tmp->_prev;
		free(tmp);
		tmp = plist->_head->_next;
	}
	free(plist->_head);
	plist->_head = NULL;
}

//main.c
#include"double slist.h"
int main()
{
	List plist;
	ListInit(&plist);
	ListPushBack(&plist, 1);
	ListPushBack(&plist, 2);
	ListPushBack(&plist, 3);
	ListPushFront(&plist, 56);
	ListPushBack(&plist, 4);
	ListPushBack(&plist, 5);
	ListPushFront(&plist, 56);
	ListPushBack(&plist, 6);
	ListPopBack(&plist, 112);
	ListPrint(&plist);
	system("pause");
	return 0;
}