四、创建一个可复用的循环链表
来源:互联网 发布:大气监测实时数据 编辑:程序博客网 时间:2024/05/17 07:05
一、CircleList.h
#ifndef _CIRCLELIST_H_
#define _CIRCLELIST_H_
typedef void CircleList;
typedef struct _tag_CircleListNode CircleListNode;
struct _tag_CircleListNode
{
CircleListNode* next;
};
CircleList* CircleList_Create(); //创建循环链表
void CircleList_Destroy(CircleList* list);
void CircleList_Clear(CircleList* list);
int CircleList_Length(CircleList* list);
int CircleList_Insert(CircleList* list, CircleListNode* node, int pos);
CircleListNode* CircleList_Get(CircleList* list, int pos);
CircleListNode* CircleList_Delete(CircleList* list, int pos);
CircleListNode* CircleList_DeleteNode(CircleList* list, CircleListNode* node); //直接删除某个元素
CircleListNode* CircleList_Reset(CircleList* list); //将游标重置指向系统的一个元素
CircleListNode* CircleList_Current(CircleList* list); //获取当前游标指向的第一个元素
CircleListNode* CircleList_Next(CircleList* list); //将游标指向系统的下一个元素
#endif
二、CircleList.c
#include <stdio.h>
#include <malloc.h>
#include "CircleList.h"
typedef struct _tag_CircleList
{
CircleListNode header;
CircleListNode* slider;
int length;
} TCircleList; //创建一个循环链表的结构体
CircleList* CircleList_Create() // O(1)
{
TCircleList* ret = (TCircleList*)malloc(sizeof(TCircleList)); //内存动态分配
if( ret != NULL ) //判断是否分配到内存
{
ret->length = 0; //初始化循环链表当前的长度为0
ret->header.next = NULL; //初始化循环链表的头结点
ret->slider = NULL; //初始化循环链表的游标
}
return ret;
}
void CircleList_Destroy(CircleList* list) // O(1)
{
free(list); //销毁线性表
}
void CircleList_Clear(CircleList* list) // O(1)
{
TCircleList* sList = (TCircleList*)list;
if( sList != NULL ) //判断线性表是否合法
{
sList->length = 0; //重置线性表当前长度为0
sList->header.next = NULL; //初始化头结点
sList->slider = NULL; //重置游标的地址
}
}
int CircleList_Length(CircleList* list) // O(1)
{
TCircleList* sList = (TCircleList*)list; //通过强制转化获取TCircleList类型的线性表
int ret = -1;
if( sList != NULL ) //判断循环链表是否合法
{
ret = sList->length;
}
return ret;
}
int CircleList_Insert(CircleList* list, CircleListNode* node, int pos) // O(n)
{
TCircleList* sList = (TCircleList*)list; //获取TCircleList类型的循环链表
int ret = (sList != NULL) && (pos >= 0) && (node != NULL);
int i = 0;
if( ret ) //判断链表循环链表是否合法,获取位置是否存在,插入元素是否存在
{
CircleListNode* current = (CircleListNode*)sList; //将当前元素的指针指向头结点
for(i=0; (i<pos) && (current->next != NULL); i++) //遍历要插入元素的位置
{
current = current->next;
}
node->next = current->next; //将插入元素的指针域指向当前元素的下一个结点
current->next = node; //而当前元素的指针指向插入当前元素
if( sList->length == 0 ) //若插入的位置为第一个元素
{
sList->slider = node; //游标指向第一个元素
node->next = node;//插入的元素要指向本身
}
sList->length++;
}
return ret;
}
CircleListNode* CircleList_Get(CircleList* list, int pos) // O(n)
{
TCircleList* sList = (TCircleList*)list;
CircleListNode* ret = NULL;
int i = 0;
if( (sList != NULL) && (pos >= 0) )
{
CircleListNode* current = (CircleListNode*)sList;
for(i=0; i<pos; i++)
{
current = current->next;
}
ret = current->next;
}
return ret;
}
CircleListNode* CircleList_Delete(CircleList* list, int pos) // O(n)
{
TCircleList* sList = (TCircleList*)list; //创建一个TCrcleListNode类型的新链表
CircleListNode* ret = NULL;
int i = 0;
if( (sList != NULL) && (pos >= 0) ) //判断循环链表是否合法,删除的元素位置是否合法
{
CircleListNode* current = (CircleListNode*)sList; //将当前的指针指向循环链表的头结点地址
CircleListNode* first = sList->header.next;//初始化frist为头结点指向的下一个元素
CircleListNode* last = (CircleListNode*)CircleList_Get(sList, sList->length - 1);//last初始化为最后倒数第二个元素
for(i=0; i<pos; i++) //通过遍历,获取我们要删除元素的前一个
{
current = current->next;
}
ret = current->next; //ret理解为要删除的元素
current->next = ret->next; //current,直接指向删除元素的下一个元素
sList->length--;
if( first == ret ) //当删除的是第一个元素时
{
sList->header.next = ret->next; //头结点指针指向第二个元素
last->next = ret->next; //最后一个元素也指向第二个元素
}
if( sList->slider == ret ) //如果游标指向为要删除的元素时,游标应下移一位
{
sList->slider = ret->next;
}
if( sList->length == 0 ) //当删除的元素为最后一个元素时要初始化
{
sList->header.next = NULL;
sList->slider = NULL;
}
}
return ret;
}
CircleListNode* CircleList_DeleteNode(CircleList* list, CircleListNode* node) // 直接删除某个元素
{
TCircleList* sList = (TCircleList*)list;
CircleListNode* ret = NULL;
int i = 0;
if( sList != NULL )
{
CircleListNode* current = (CircleListNode*)sList;
for(i=0; i<sList->length; i++) //通过遍历,当current指向我们要删除的元素时,停止遍历,获取删除元素的位置
{
if( current->next == node )
{
ret = current->next;
break;
}
current = current->next;
}
if( ret != NULL )
{
CircleList_Delete(sList, i); //通过元素的位置进行删除
}
}
return ret;
}
CircleListNode* CircleList_Reset(CircleList* list) // 将游标重置到循环链表的第一个数据元素
{
TCircleList* sList = (TCircleList*)list;
CircleListNode* ret = NULL;
if( sList != NULL )
{
sList->slider = sList->header.next;
ret = sList->slider;
}
return ret;
}
CircleListNode* CircleList_Current(CircleList* list) // 获取游标指向的位置的元素
{
TCircleList* sList = (TCircleList*)list;
CircleListNode* ret = NULL;
if( sList != NULL )
{
ret = sList->slider;
}
return ret;
}
CircleListNode* CircleList_Next(CircleList* list) // 将游标指向链表的下一个元素
{
TCircleList* sList = (TCircleList*)list;
CircleListNode* ret = NULL;
if( (sList != NULL) && (sList->slider != NULL) )
{
ret = sList->slider;
sList->slider = ret->next;
}
return ret;
}
三、main.c
#include <stdio.h>
#include <stdlib.h>
#include "CircleList.h"
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
struct Value
{
CircleListNode header;
int v;
};
int main(int argc, char *argv[])
{
int i = 0;
CircleList* list = CircleList_Create();
struct Value v1;
struct Value v2;
struct Value v3;
struct Value v4;
struct Value v5;
struct Value v6;
struct Value v7;
struct Value 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_Insert(list, (CircleListNode*)&v1, CircleList_Length(list));
CircleList_Insert(list, (CircleListNode*)&v2, CircleList_Length(list));
CircleList_Insert(list, (CircleListNode*)&v3, CircleList_Length(list));
CircleList_Insert(list, (CircleListNode*)&v4, CircleList_Length(list));
CircleList_Insert(list, (CircleListNode*)&v5, 5);
CircleList_Delete(list, 0);
for(i=0; i<2*CircleList_Length(list); i++)
{
struct Value* pv = (struct Value*)CircleList_Get(list, i);
printf("%d\n", pv->v);
}
printf("\n");
while( CircleList_Length(list) > 0 )
{
struct Value* pv = (struct Value*)CircleList_Delete(list, 0);
printf("%d\n", pv->v);
}
printf("\n");
CircleList_Insert(list, (CircleListNode*)&v1, CircleList_Length(list));
CircleList_Insert(list, (CircleListNode*)&v2, CircleList_Length(list));
CircleList_Insert(list, (CircleListNode*)&v3, CircleList_Length(list));
CircleList_Insert(list, (CircleListNode*)&v4, CircleList_Length(list));
CircleList_Insert(list, (CircleListNode*)&v5, CircleList_Length(list));
CircleList_Insert(list, (CircleListNode*)&v6, CircleList_Length(list));
CircleList_Insert(list, (CircleListNode*)&v7, CircleList_Length(list));
CircleList_Insert(list, (CircleListNode*)&v8, CircleList_Length(list));
for(i=0; i<CircleList_Length(list); i++)
{
struct Value* pv = (struct Value*)CircleList_Next(list);
printf("%d\n", pv->v);
}
printf("\n");
CircleList_Reset(list);
while( CircleList_Length(list) > 0 )
{
struct Value* pv = NULL;
for(i=1; i<3; i++)
{
CircleList_Next(list);
}
pv = (struct Value*)CircleList_Current(list);
printf("%d\n", pv->v);
CircleList_DeleteNode(list, (CircleListNode*)pv);
}
CircleList_Destroy(list);
return 0;
}
- 四、创建一个可复用的循环链表
- 循环链表的创建
- 循环链表的创建
- 【四】循环链表
- 四、创建一个表mytable
- 创建一个双向链表或双向循环链表
- 创建一个双向链表或双向循环链表
- 创建一个双向链表或双向循环链表
- 用Java创建一个循环链表例子
- 创建一个流畅循环的UIScrollView
- 创建一个不断循环切换的动画
- 循环链表创建
- 循环链表的创建和读取
- 循环链表的创建及遍历
- 怎样循环的创建链表
- 循环链表的创建及遍历
- 循环链表的创建与输出
- 创建一个表并循环插入数据
- uiview-bottom-border
- WIN7上帝模式God Mode
- 黑马程序员—反射篇
- Java I/O体系(二)
- poj 3683 2-sat
- 四、创建一个可复用的循环链表
- vi 常用命令行
- 触摸(Touch)
- xutils中dbutils的基础使用详解
- Matlab神经网络验证码识别
- servlet 异常
- web应用的过程中,http常见的错误代码
- windows如何在命令行下编译C/C++程序
- iOS 音乐类App必备功能:后台播放、锁屏封面、远程播放控制