循環鏈表和單鏈表其實區別不大,差別僅在于算法中的循環條件不是p或者p->next,而是是否等于頭指針。下面這個例子簡單的實現了循環鏈表的基本操作,其中插入和刪除只是完成了主要的部分,沒有判斷。

#include

#include

struct Data

{

char name;

int age;

};

struct CirList

{

Data *data;

CirList *next;

};

CirList* InitListhead()

{

CirList *list;

list = (CirList*)malloc(sizeof(CirList));

list->next = NULL;

return list;

}

CirList *CreateData()

{

CirList *node;

node = (CirList*)malloc(sizeof(CirList));

node->next = NULL;

node->data = (Data*)malloc(sizeof(Data));

printf("輸入姓名:");

scanf("%c",&node->data->name);

printf("輸入年齡:");

scanf("%d",&node->data->age);

getchar();

return node;

}

//頭插法初始化鏈表

void InitList(CirList *head)

{

CirList *node ;

node = CreateData();

//新結點的next指針域賦給頭結點的next指針域

node->next = head->next;

//新結點賦給頭結點的指針域

head->next = node;

//新結點指針域指向頭結點

node->next = head;

}

//尾插法初始化鏈表

void InitList_2(CirList *list)

{

CirList *node,*p=list;

int i = 0;

while(i<3)

{

node = CreateData();

p->next = node;

p = node;

i++;

}

//令表尾指針指向頭結點

node->next = list;

}

void Insert(CirList *list)

{

CirList *node,*saveHead = list;

node = CreateData();

printf("輸入插入位置:");

int position,i=0;

scanf("%d",&position);

//尋找插入的前驅

while(list != NULL && i < position-1)

{

list = list->next;

i++;

}

node->next = list->next;

list->next = node;

}

void Delete(CirList *list)

{

CirList *temp,*saveHead = list;;

printf("輸入刪除位置:");

int position,i=0;

scanf("%d",&position);

//尋找插入的前驅

while(list != NULL && i < position-1)

{

list = list->next;

i++;

}

temp = list->next;

list->next = temp->next;

free(temp);

}

void Output(CirList *list)

{

CirList *p = list->next;

printf("鏈表中所有數據如下:\n");

while(p != list)

{

printf("姓名:%c\n",p->data->name);

printf("年齡:%d\n",p->data->age);

p = p->next;

}

}

void menu()

{

printf("*****循環鏈表練習*****\n");

printf(" * 1---初始化鏈表\n");

printf(" * 2---刪除數據\n");

printf(" * 3---插入數據\n");

printf(" * 4---輸出數據\n");

printf(" * 0---退出\n");

printf("********************\n");

}

int main()

{

CirList *list;

list = InitListhead();

int i=0;

printf("初始化數據:\n");

//while(i<3)

{

//InitList(list);

//i++;

}

int choose;

do

{

menu();

printf("輸入您的選擇:");

scanf("%d",&choose);

getchar();

switch(choose)

{

case 1:

InitList_2(list);

break;

case 2:

Delete(list);

break;

case 3:

Insert(list);

break;

case 4:

Output(list);

break;

}

}while(choose !=0);

return 0;

}