循环链表（c实现）(2)

return ret;

}

=========================================

circlelist_test.c

=========================================

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include "circlelist.h"

typedef struct Value

{

CircleListNode header;

int v;

}Value;

int main01()

{

CircleList* clist = CircleList_Create();

Value v1, v2, v3, v4, v5, v6, v7, v8;

v1.v = 1;

v2.v = 2;

v3.v = 3;

v4.v = 4;

// v5.v = 5;

// v6.v = 6;

// v7.v = 7;

// v8.v = 8;

CircleList_Clear(clist);

CircleList_Insert(clist, CircleList_Length(clist), (CircleListNode*)&v1);

CircleList_Insert(clist, CircleList_Length(clist), (CircleListNode*)&v2);

CircleList_Insert(clist, CircleList_Length(clist), (CircleListNode*)&v3);

CircleList_Insert(clist, CircleList_Length(clist), (CircleListNode*)&v4);

int i;

for(i = 0; i < 2*CircleList_Length(clist); i++)

{

Value* tmp;

tmp = (Value*)CircleList_Get(clist, i);

printf("the clist node: %d \n", tmp->v);

}

Value* delNode = (Value*)CircleList_Delete(clist, 0);

printf("the delNode node: %d \n", delNode->v);

for(i = 0; i < CircleList_Length(clist); i++)

{

Value* tmp;

tmp = (Value*)CircleList_Get(clist, i);

printf("the clist node: %d \n", tmp->v);

}

Value* tmp;

tmp = (Value*) CircleList_DeleteNode(clist, (CircleListNode*)&v2);

printf("the tmp node: %d \n", tmp->v);

for(i = 0; i < CircleList_Length(clist); i++)

{

Value* tmp;

tmp = (Value*)CircleList_Get(clist, i);

printf("the clist node: %d \n", tmp->v);

}

CircleList_Reset(clist);

while(CircleList_Length(clist) > 0)

{

Value *pv = NULL;

for(i = 1; i<3; i++)

{

CircleList_Next(clist);

}

pv = (Value*)CircleList_Current(clist);

printf("%d \n", pv->v);

CircleList_DeleteNode(clist, (CircleListNode*)pv);

}

CircleList_Destroy(clist);

printf("Hello world!\n");

return 0;

}

====================================

circlelist_test01.c

====================================

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include "circlelist.h"

//=======约瑟夫问题==========//

typedef struct Value

{

CircleListNode header;

int v;

}Value;

int main()

{

CircleList* clist = CircleList_Create();

Value v1, v2, v3, v4, v5, v6, v7, v8;

v1.v = 1;

v2.v = 2;

v3.v = 3;

v4.v = 4;

v5.v = 5;

v6.v = 6;

v7.v = 7;

v8.v = 8;

CircleList_Clear(clist);

CircleList_Insert(clist, CircleList_Length(clist), (CircleListNode*)&v1);

CircleList_Insert(clist, CircleList_Length(clist), (CircleListNode*)&v2);

CircleList_Insert(clist, CircleList_Length(clist), (CircleListNode*)&v3);

CircleList_Insert(clist, CircleList_Length(clist), (CircleListNode*)&v4);

CircleList_Insert(clist, CircleList_Length(clist), (CircleListNode*)&v5);

CircleList_Insert(clist, CircleList_Length(clist), (CircleListNode*)&v6);

CircleList_Insert(clist, CircleList_Length(clist), (CircleListNode*)&v7);

CircleList_Insert(clist, CircleList_Length(clist), (CircleListNode*)&v8);

int i;

for(i = 0; i < CircleList_Length(clist); i++)

{

Value* tmp;

tmp = (Value*)CircleList_Get(clist, i);

printf("the clist node: %d \n", tmp->v);

}

printf("\n");

CircleList_Reset(clist);

while(CircleList_Length(clist) > 0)

{

Value *pv = NULL;

for(i = 1; i<3; i++)

{

CircleList_Next(clist);

}

pv = (Value*)CircleList_Current(clist);

printf("%d \n", pv->v);

CircleList_DeleteNode(clist, (CircleListNode*)pv);

}

CircleList_Destroy(clist);

printf("Hello world!\n");

return 0;

}

本文来自电脑杂谈，转载请注明本文网址：
http://www.pc-fly.com/a/jisuanjixue/article-124775-2.html