//main.c--双向循环链表,带头结点#include#includetypedefcharElemType;typedefstructDuLNode{ElemTypedata;structDuLNode*prior;structDuLNode*next;}DuLNode,*DuLinkList;#defineNUM26intInitList(DuLinkList*L,intn);voidTraverseList(DuLinkListL,inti);voidDestroyList(DuLinkList*L);intmain(intargc,charconst*argv[]){DuLinkListL=NULL;InitList(&L,NUM);printf("L=0x%x\n",L);//printf("%c\n",L->data);TraverseList(L,3);printf("L=0x%x\n",L);//printf("%c\n",L->data);DestroyList(&L);printf("L=0x%x\n",L);printf("\nBye!\n");return0;}intInitList(DuLinkList*L,intn){inti;DuLinkListp;//保存尾结点DuLinkListq;//保存每次新建的结点*L=(DuLinkList)malloc(sizeof(DuLNode));if(!(*L)){return0;}(*L)->data='#';(*L)->prior=(*L)->next=NULL;p=*L;for(i=0;idata='A'+i;q->prior=p;q->next=p->next;p->next=q;p=q;}//+---++---++---++---++---++---+//NULLNULL//+---++---++---++---++---++---+//*Lpif((*L)->next!=NULL){(*L)->next->prior=p;p->next=(*L)->next;}//___________________________________//↑↓//+---++---++---++---++---++---+//NULL|N|//+---++---++---++---++---++---+//↑___________________________________↓//*Lpreturn1;}voidTraverseList(DuLinkListL,inti){intj;DuLinkListp;if(!L){return;}if(L->next==NULL){return;}p=L->next;if(i>0){do{p=p->next;}while(--i);}if(iprior;}while(++i);}for(j=0;jdata);p=p->next;}printf("\n");}voidDestroyList(DuLinkList*L){//DuLinkListhead=(*L)->next;//DuLinkListp=(*L)->next;//DuLinkListq;//do//{//q=p->next;//printf("free%c",p->data);//free(p);//p=q;//}while(p!=head);//printf("free%c\n",(*L)->data);//free(*L);//*L=NULL;DuLinkListrear;DuLinkListp;if((*L)->next!=NULL){rear=(*L)->next->prior;while((*L)!=rear){p=(*L)->next;printf("free%c",(*L)->data);free(*L);*L=p;}}printf("free%c\n",(*L)->data);free(*L);*L=NULL;} |