測試框架:
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include"CircleList.h"
using namespace std;
struct Teacher
{
CircleListNode node;
int age;
char name[64];
};
void main()
{
int i = 0, len = 0;
Circlelist* list = NULL;
list = List_Create();
if (list == NULL)
{
return;
}
Teacher t1, t2, t3, t4, t5;
t1.age = 20;
strcpy(t1.name, "wang1");
t2.age = 30;
strcpy(t2.name, "wang2");
t3.age = 40;
strcpy(t3.name, "wang3");
t4.age = 50;
strcpy(t4.name, "wang4");
t5.age = 60;
strcpy(t5.name, "wang5");
len = List_Length(list);
List_Inster(list, (CircleListNode*)&t1, 0);
List_Inster(list, (CircleListNode*)&t2, 0);
List_Inster(list, (CircleListNode*)&t3, 0);
List_Inster(list, (CircleListNode*)&t4, 0);
List_Inster(list, (CircleListNode*)&t5, 0);
//遍歷
for (i = 0; i < 2*List_Length(list); i++)//證明是否是循環鏈表只要把長度乘以2,打印兩次
{
Teacher* tmp = (Teacher*)List_Get(list, i);
if (tmp == NULL)
{
return;
}
printf("teacher->age :%d\n", tmp->age);
printf("teacher->name :%s\n", tmp->name);
}
//刪除鏈表
while (List_Length(list)>0)
{
Teacher* tmp = (Teacher*)List_Delete(list, 0);
if (tmp == NULL)
{
return;
}
printf("teacher->age :%d\n", tmp->age);
}
List_Destory(list);
system("pause");
}
頭文件
#pragma once #ifdef _MYLIST_H_ #define _MYLIST_H_ #endif // _MYSEQLIST_H_ typedef void Circlelist; typedef struct CircleListNode { struct CircleListNode* next; }; /*創建列表*/ Circlelist * List_Create(); /*釋放列表*/ void List_Destory(Circlelist* list); /*清空列表 回到初始狀態*/ void List_Clear(Circlelist* list); /*獲取鏈表的長度*/ int List_Length(Circlelist* list); /*獲取指定位置的鏈表的元素數據*/ CircleListNode* List_Get(Circlelist* list, int pos); /*插入元素數據*/ int List_Inster(Circlelist* list, CircleListNode* node, int pos); /*元素數據刪除*/ CircleListNode* List_Delete(Circlelist* list, int pos); //add CircleListNode* Circle_DeleteNode(Circlelist* list,CircleListNode* node); //重置遊標,重新指向鏈表的頭部 CircleListNode* Circle_Reset(Circlelist* list); //獲取當前遊標 CircleListNode* Circle_Current(Circlelist* list); //把當前的位置返回,並使遊標指向下一個位置 CircleListNode* Circle_Next(Circlelist* list);
頭文件實現;
#include"CircleList.h"
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
typedef struct TLinkList
{
CircleListNode header;
CircleListNode* slider;
int lenght;
};
/*創建列表*/
Circlelist * List_Create()
{
TLinkList* ret = NULL;
ret = (TLinkList*)malloc(sizeof(TLinkList));
memset(ret, 0, sizeof(TLinkList));
ret->lenght = 0;
ret->header.next = NULL;
ret->slider = NULL;
return ret;
}
/*釋放列表*/
void List_Destory(Circlelist* list)
{
if (list != NULL)
{
free(list);
list = NULL;
}
return;
}
/*清空列表 回到初始狀態*/
void List_Clear(Circlelist* list)
{
TLinkList *tlist = NULL;
if (list == NULL)
{
return;
}
tlist = (TLinkList*)list;
tlist->lenght = 0;
tlist->header.next = NULL;
tlist->slider = NULL;
return;
}
/*獲取鏈表的長度*/
int List_Length(Circlelist* list)
{
TLinkList* tlist = NULL;
if (list == NULL)
{
return 0;
}
tlist = (TLinkList*)list;
return tlist->lenght;
}
/*獲取指定位置的鏈表的元素數據*/
CircleListNode* List_Get(Circlelist* list, int pos)
{
int i = 0;
if (list == NULL || pos<0)
{
return NULL;
}
CircleListNode* current = NULL;
TLinkList* tlist = NULL;
tlist = (TLinkList*)list;
current = &(tlist->header);
//讓輔助指針指向鏈表的頭部
for (i = 0; i < pos && (current->next != NULL); i++)
{
current = current->next;
}
return current->next;
}
/*插入元素數據*/
int List_Inster(Circlelist* list, CircleListNode* node, int pos)
{
if (list == NULL || pos<0 || node == NULL)
{
return 0;
}
int i = 0, ret = 0;
TLinkList* tlist = NULL;
tlist = (TLinkList*)list;
CircleListNode* current = (CircleListNode*)tlist;
//current = &(tlist->header);
for (i = 0; i < pos && (current->next != NULL); i++)
{
current = current->next;
}
node->next = current->next;
current->next = node;
//若是第一次插入節點
if (tlist->lenght==0)
{
tlist->slider = node;
}
tlist->lenght++;
//若是頭插法 current仍然指向頭部
//原因是:跳0步,沒有跳走 或者pos是0 代表是頭插法
if (current==(CircleListNode*)tlist)
{
//獲取最後一個元素
CircleListNode* last = List_Get(tlist,tlist->lenght-1);
last->next = current->next;
}
return 0;
}
/*元素數據刪除*/
CircleListNode* List_Delete(Circlelist* list, int pos)
{
int i = 0;
if (list == NULL || pos<0)
{
return 0;
}
TLinkList* tlist = NULL;
CircleListNode* current = NULL;
tlist = (TLinkList*)list;
current = &(tlist->header);
CircleListNode* ret = NULL;
CircleListNode* last = NULL;
for (i = 0; i <pos && (current->next != NULL); i++)
{
current = current->next;
}
//若刪除的是第一個元素
if (current==(CircleListNode*)tlist)
{
last = (CircleListNode*)List_Get(tlist, tlist->lenght - 1);
}
//求要刪除的元素
ret = current->next;
current->next = ret->next;
tlist->lenght--;
//判斷鏈表是否爲空
if (last != NULL)
{
tlist->header.next = ret->next;
last->next = ret->next;
}
//若刪除的元素爲遊標所指的元素
if (tlist ->slider ==ret)
{
tlist->slider = ret->next;
}
//若刪除元素後,鏈表長度爲0
if (tlist->lenght==0)
{
tlist->header.next = NULL;
tlist->slider = NULL;
}
return ret;
}
CircleListNode* Circle_DeleteNode(Circlelist* list, CircleListNode* node)
{
TLinkList* tlist = NULL;
tlist = (TLinkList*)list;
CircleListNode* ret = NULL;
int i = 0;
if (tlist!= NULL)
{
CircleListNode* current = (CircleListNode*)tlist;
for ( i = 0; i < tlist->lenght; i++)
{
if (current ->next==node)
{
ret = current->next;
break;
}
current = current->next;
}
if (ret!=NULL)
{
List_Delete(tlist,i);
}
}
return ret;
}
CircleListNode* Circle_Reset(Circlelist* list)
{
TLinkList* tlist = (TLinkList*)list;
CircleListNode* ret = NULL;
if (tlist!=NULL)
{
tlist->slider = tlist->header.next;
ret = tlist->slider;
}
return NULL;
}
CircleListNode* Circle_Current(Circlelist* list)
{
TLinkList* tlist = (TLinkList*)list;
CircleListNode* ret = NULL;
if (tlist != NULL)
{
ret = tlist->slider;
}
return ret;
}
CircleListNode* Circle_Next(Circlelist* list)
{
TLinkList* tlist = (TLinkList*)list;
CircleListNode* ret = NULL;
if ((tlist != NULL)&&tlist->slider!=NULL)
{
ret = tlist->slider;
tlist->slider = ret->next;
}
return ret;
}