带头结点链表c语言,c语言带头结点的双向循环链表

淡淡的烟草味﹌ 2022-10-15 00:41 213阅读 0赞

//头文件

\#include

typedef enum Status

StatusFail,

StatusOk

\}Status;

typedef struct ElemType

int m\_pid;

int m\_exit;

\}ElemType;

typedef struct DuLNode

ElemType data;

struct DuLNode \*pre;

struct DuLNode \*next;

\}DuLNode, \*DuLinkList, \*PNode;

//辅助函数

int CompareElem(ElemType \*a, ElemType \*b);

int CopyElem(ElemType\*dest, ElemType \*source);

//public接口

Status InitList(DuLinkList \*L);

Status DestroyList(DuLinkList \*L);

Status ClearList(DuLinkList L);

Status ListInsert(DuLinkList L, PNode node, ElemType e);

PNode ListDelete(DuLinkList L, PNode node, ElemType \*e);

PNode ListFind(DuLinkList L, ElemType e);

void ListTraverse(DuLinkList L, void(\*visit)(ElemType \*e) );

//private接口

//cpp文件

\#include"doubleLinkList.h"

\#include

int CompareElem(ElemType \*a, ElemType \*b)

if(a->m\_pid == b->m\_pid

&& a->m\_exit == b->m\_exit)

return 0;

else

return 1;

int CopyElem(ElemType\*dest, ElemType \*source)

dest->m\_pid = source->m\_pid;

dest->m\_exit = source->m\_exit;

//public接口

Status InitList(DuLinkList \*L)

\*L = (DuLinkList)malloc(sizeof(DuLNode));

if(\*L == NULL)

return StatusFail;

else

(\*L)->pre = (\*L)->next = \*L;

return StatusOk;

Status DestroyList(DuLinkList \*L)

ClearList(\*L);

free(\*L);

\*L=NULL;

return StatusOk;

Status ListInsert(DuLinkList L, PNode node, ElemType e)

PNode pe = (PNode)malloc(sizeof(DuLNode));

if(pe == NULL)

return StatusFail;

//pe->data = e;

CopyElem(&(pe->data), &e);

pe->pre = node->pre; node->pre->next = pe;

pe->next = node;  node->pre = pe;

return StatusOk;

//必须保证node不是头结点

PNode ListDelete(DuLinkList L, PNode node, ElemType \*e)

//\*e = p->data;

CopyElem(&(node->data), e);

node->pre->next = node->next;

node->next->pre = node->pre;

free(node);

return node->next;

PNode ListFind(DuLinkList L, ElemType e)

PNode ret = L->next;

while(ret != L)

if(CompareElem(&(ret->data), &e) == 0)

return ret;

ret = ret->next;

return NULL;

Status ClearList(DuLinkList L)

PNode q, p = L->next;

while(p != L)

q = p->next;

free(p);

p = q;

L->pre = L->next = L;

return StatusOk;

void ListTraverse(DuLinkList L, void (\*visit)(ElemType \*e))

PNode p= L->next; // p指向头结点

while(p != L)

visit(&(p->data));

p=p->next;

printf("\\n");

//测试代码

\#include"DoubleLinkList.c"

void print(ElemType \*e)

printf("%d, %d\\n", e->m\_pid, e->m\_exit);

int main()

ElemType a = \{1, 0\};

ElemType b = \{2, 0\};

ElemType c = \{3, 0\};

ElemType d = \{4, 0\};

DuLinkList L;

InitList(&L);

printf("\\nListInsert\\n");

ListInsert(L, L, a);

ListInsert(L, L, b);

ListInsert(L, L, c);

ListTraverse(L, print);

printf("\\nListFind\\n");

PNode pb = ListFind(L, b);

pb->data.m\_exit = 1;

printf("%d, %d\\n", pb->data.m\_pid, pb->data.m\_exit);

printf("\\nListDelete\\n");

ListDelete(L, pb, &d);

ListTraverse(L, print);

printf("\\nListFind\\n");

PNode pd = ListFind(L, d);

(pd == NULL)? printf("NULL\\n") : printf("\\n%d, %d\\n", pd->data.m\_pid, pd->data.m\_exit);

printf("\\nClearList\\n");

ClearList(L);

ListTraverse(L, print);

printf("\\nDestroyList\\n");

DestroyList(&L);

system("pause");

return 0;

匆忙完成，如果疏漏请各位指正。

带头结点链表c语言,c语言带头结点的双向循环链表

发表评论取消回复

还没有评论，来说两句吧...

相关阅读

相关带头结点的双向循环链表

相关 C语言实现链表【二】带头双向循环链表

相关 65-双向链表的实现（带头结点）

相关 5.带头结点的双向循环链表

相关 4.带头结点的双链表

相关 2.带头结点的单链表

相关 Python实现单链表（带头结点）

相关带头结点链表c语言,c语言带头结点的双向循环链表

相关栈（带头结点链表）

相关数据结构——电话本-链表-带头结点