插入的3种场景:
第一种:
第二种:
第三种:
删除的3种场景
优点:功能强了。
循环链表只是在单链表的基础上做了一个加强
循环链表可以完全取代单链表的使用
循环链表的Next和Current操作可以高效的遍历链表中的所有元素
缺点:
代码复杂度提高了
#ifndef _KNCIRCLELIST_H_
#define _KNCIRCLELIST_H_
/*
带有头结点的循环链表
循环链表的定义:将单链表中最后一个数据元素的next指针指向第一个元素
*/
//定义为void
typedef void CircleList;
typedef struct _tag_CircleListNode
{
struct _tag_CircleListNode *next;
}CircleListNode;
//创建循环链表
CircleList* CircleList_Create();
//销毁循环链表
void CircleList_Destroy(CircleList* list);
//清空循环链表
void CircleList_Clear(CircleList* list);
//获取循环链表长度
int CircleList_Length(CircleList* list);
//向循环链表的pos位置插入node节点
int CircleList_Insert(CircleList* list, CircleListNode* node, int pos);
//获取pos位置的节点
CircleListNode* CircleList_Get(CircleList* list, int pos);
//删除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
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "knDebug.h"
#include "knCirclelist.h"
typedef struct _tag_CircleList
{
CircleListNode header; //头指针
CircleListNode *slider; //游标("当前指针")
int length; //链表长度
}TCircleList;
//创建循环链表
CircleList* CircleList_Create()
{
TCircleList *ret = (TCircleList*)malloc(sizeof(TCircleList));
if (ret == NULL){
DEBUG("ret == NULL\n");
return NULL;
}
ret->length = 0;
ret->header.next = NULL;
ret->slider = NULL;
return ret;
}
//销毁循环链表
void CircleList_Destroy(CircleList* list)
{
if (list == NULL)
{
return;
}
free(list);
}
//清空循环链表
void CircleList_Clear(CircleList* list)
{
TCircleList *sList = (TCircleList *)list;
sList->length = 0;
sList->header.next = NULL;
sList->slider = NULL;
}
//获取循环链表长度
int CircleList_Length(CircleList* list)
{
TCircleList *sList = (TCircleList*)list;
int ret = -1;
if (list == NULL){
DEBUG("ret == NULL\n");
return ret;
}
ret = sList->length;
return ret;
}
//向循环链表的pos位置插入node节点
int CircleList_Insert(CircleList* list, CircleListNode* node, int pos)
{
int ret = 0, i = 0;
TCircleList *sList = (TCircleList*)list;
if (list == NULL || node == NULL || pos < 0){
DEBUG("list == NULL || node == NULL || pos < 0\n");
return -1;
}
//将辅助指针变量指向头部
CircleListNode* current = (CircleListNode*)sList;
for (i = 0; i < pos && current->next != NULL; i++){
current = current->next;
}
//第1种场景 普通的插入且 current->next != NULL 12
//第2种场景 从无到有的尾部插入 12
//第3种场景 头插法 123
node->next = current->next; //1
current->next = node; //2
//若是第一次插入节点 即从无到有的尾部插入
if (sList->length == 0){
sList->slider = node;//指向pos为0的节点 游标的初始值
}
sList->length++;
//若是头插法,current仍然指向头部 原因是跳0步,没有跳走
if (current == (CircleListNode *)sList){//本语句是判断头插法
CircleListNode *last = CircleList_Get(sList, sList->length - 1);//3
last->next = current->next;//3 此时的current->next 已经是node节点了 76行
}
return ret;
}
//获取pos位置的节点
CircleListNode* CircleList_Get(CircleList* list, int pos)
{
TCircleList *sList = (TCircleList*)list;
CircleListNode *ret = NULL;
int i = 0;
if (sList == NULL || pos < 0){
return NULL;
}
//让辅助指针变量指向头部
CircleListNode *current = (CircleListNode*)sList;
for (i = 0; i < pos; i++){
current = current->next;
}
ret = current->next;
return ret;
}
//删除pos位置的节点
CircleListNode* CircleList_Delete(CircleList* list, int pos)
{
TCircleList *sList = (TCircleList*)list;
CircleListNode *ret = NULL;
int i = 0;
if (sList != NULL && pos >= 0 && sList->length > 0)
{
CircleListNode *current = (CircleListNode*)sList;
CircleListNode *last = NULL;
for (i = 0; i < pos; i++){
current = current->next;
}
//若删除第一个元素,则涉及到尾部元素了,作为辅助指针变量
if (current == (CircleListNode*)sList){
last = (CircleListNode*)CircleList_Get(sList, sList->length - 1);
}
//缓存要删除的元素
ret = current->next;
current->next = ret->next;
sList->length--;
//说明删除的是第一个元素
if (last != NULL){//
sList->header.next = ret->next; //头节点指向链表的新的首元素
last->next = ret->next; //链表的尾部元素指向首元素
}
//若删除的元素为游标所指的元素
if (sList->slider == ret){
sList->slider = ret->next;//将游标指向当前节点
}
//若删除元素后,链表长度为0
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;
//查询node在链表中的位置
for (i = 0; i < sList->length; i++){
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;
}
#include <stdlib.h>
#include <stdio.h>
#include "knCirclelist.h"
#include "knDebug.h"
typedef struct Value{
CircleListNode circlenode;
int v;
char name[64];
}Value;
void test()
{
CircleList *list = 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_Insert(list, (CircleList*)&v1, 0);//头插法 游标始终指向位置为0的元素
CircleList_Insert(list, (CircleList*)&v2, 0);
CircleList_Insert(list, (CircleList*)&v3, 0);
CircleList_Insert(list, (CircleList*)&v4, 0);
//如何证明是循环链表 打印2倍的链表长度 若元素一样,则证明是循环链表
printf("------证明是循环链表------\n");
for (int i = 0; i < 2 * CircleList_Length(list); i++){
//将节点取出来转换为业务节点
Value *pv = (Value*)CircleList_Get(list, i);
printf("%d\n", pv->v);
if (i == CircleList_Length(list) - 1){
printf("------第2遍------\n");
}
}
printf("------游标操作------\n");
//获取当前游标指向的元素
Value *current = (Value*)CircleList_Current(list);
printf("1-当前游标 指向的值 %d\n", current->v);
//将游标移动指向到链表中的下一个元素
Value *before = (Value*)CircleList_Next(list);
printf("2-游标移动之前 指向的值 %d\n", before->v);
current = (Value*)CircleList_Current(list);
printf("3-游标移动之后 指向的值 %d\n", current->v);
//直接指定删除链表中的某个数据元素
Value *deleteNode = (Value *)CircleList_DeleteNode(list, (CircleList*)&v1);
printf("4-删除指定的元素%d: 函数返回删除的指定元素%d\n", v1.v, deleteNode->v);
//通过游标遍历循环链表
printf("---------使用游标遍历 循环链表---------\n");
int length = CircleList_Length(list);
int i = 0;
for (Value *it = (Value*)CircleList_Current(list); i < length; CircleList_Next(list), i++){
Value * current = (Value*)CircleList_Current(list);
printf("%d ", current->v);
}
printf("\n");
printf("---------删除 循环链表---------\n");
while (CircleList_Length(list) > 0){
Value * ret = (Value *)CircleList_Delete(list, 0);//删除第一个元素
printf("删除的元素为%d\n", ret->v);
}
printf("\n");
CircleList_Destroy(list);
}
int main()
{
test();
system("pause");
return 0;
}