头文件List.h
#include<stdio.h>
#include <malloc.h>
#include <assert.h>
#include<windows.h>
typedef int LTDataType;
typedef struct ListNode
{
LTDataType _data;
struct ListNode* next;
struct ListNode* prev;
}ListNode;
ListNode* ListCreate();
void ListDestory(ListNode** pplist);
void ListPrint(ListNode* plist);
void ListPushBack(ListNode* plist, LTDataType x);
void ListPopBack(ListNode* plist);
void ListPushFront(ListNode* plist, LTDataType x);
void ListPopFront(ListNode* plist);
void ListErase(ListNode* pos);
ListNode* ListFind(ListNode* plist, LTDataType x);
void ListInsert(ListNode* pos, LTDataType x);
源文件List.c
# include"List.h"
ListNode* buyListDestory(LTDataType data){
ListNode* newnode = (ListNode*)malloc(sizeof(ListNode));
newnode->_data = data;
newnode->next = NULL;
newnode->prev = NULL;
return newnode;
}
ListNode* ListCreate(){
ListNode* plist = buyListDestory(0);
plist->next = plist;
plist->prev = plist;
return plist;
}
void ListDestory(ListNode** pplist){
assert(pplist);
ListNode* cur = (*pplist)->next;
while (cur !=*pplist){
(*pplist)->next = cur->next;
free(cur);
cur = (*pplist)->next;
}
free(*pplist);
*pplist = NULL;
}
void ListPrint(ListNode* plist){
assert(plist);
ListNode* cur = plist->next;
while (cur != plist){
printf("%d ", cur->_data);
cur = cur->next;
}
printf("\n");
}
void ListPushBack(ListNode* plist, LTDataType x){
assert(plist);
ListNode* newnode = buyListDestory(x);
newnode->next = plist;
newnode->prev = plist->prev;
plist->prev->next = newnode;
plist->prev = newnode;
}
void ListPopBack(ListNode* plist){
assert(plist);
ListNode* cur = plist->prev;
cur->prev->next = plist;
plist->prev = cur->prev;
free(cur);
}
void ListPushFront(ListNode* plist, LTDataType x){
assert(plist);
ListNode* newnode = buyListDestory(x);
newnode->next = plist->next;
newnode->prev = plist;
plist->next = newnode;
newnode->next->prev = newnode;
}
void ListPopFront(ListNode* plist){
assert(plist);
ListNode* cur = plist->next;
plist->next = cur->next;
cur->next->prev = plist;
free(cur);
}
ListNode* ListFind(ListNode* plist, LTDataType x){
assert(plist);
ListNode* cur = plist->next;
while (cur != plist){
if (cur->_data == x){
return cur;
}
cur = cur->next;
}
return NULL;
}
void ListErase(ListNode* pos){
if (pos == NULL){
return;
}
pos->prev->next = pos->next;
pos->next->prev = pos->prev;
free(pos);
}
void ListInsert(ListNode* pos, LTDataType x){
if (pos == NULL){
return;
}
ListNode* newnode = buyListDestory(x);
newnode->next = pos;
newnode->prev = pos->prev;
pos->prev->next= newnode;
pos->prev = newnode;
}
源文件test.c
# include"List.h"
int Test(){
ListNode* plist=ListCreate();
ListPushBack(plist,1);
ListPushBack(plist, 2);
ListPushBack(plist, 3);
ListPushBack(plist, 4);
ListPushBack(plist, 5);
ListPrint(plist);
ListPopBack(plist);
ListPopBack(plist);
ListPrint(plist);
ListPushFront(plist, 0);
ListPrint(plist);
ListPopFront(plist);
ListErase(ListFind(plist, 3));
ListInsert(ListFind(plist, 2),5);
ListPrint(plist);
ListDestory(&plist);
}
int main(){
Test();
system("pause");
return 0;
}