数据结构：循环链表

原创

顾道长生 2022-07-13 09:43:46 博主文章分类：数据结构 ©著作权

文章标签 数据结构 C语言 ide i++ #include 文章分类 数据结构与算法人工智能

©著作权归作者所有：来自51CTO博客作者顾道长生的原创作品，请联系作者获取转载授权，否则将追究法律责任

听了国嵌唐老师的课，用C语言实现：

数据结构：循环链表_i++

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_Destory(CircleList* list);//销毁链表表CircleList

void CircleList_Clear(CircleList* list);//清空链表

int CircleList_Length(CircleList* list);//返回链表长度

int CircleList_Insert(CircleList* list,CircleListNode* node,int pos);//在pos插入node，返回1表示插入成功

CircleListNode* CircleList_Get(CircleList* list,int pos);//获取pos位置元素，返回pos位置元素 

CircleListNode* CircleList_Delete(CircleList* list,int pos);//删除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()
{
  TCircleList* ret = (TCircleList*)malloc(sizeof(TCircleList));
  
  if(ret != NULL)
  {
    ret->length = 0;
    ret->header.next = NULL;
    ret->slider = NULL;
  }
  
  return ret;
}

void CircleList_Destory(CircleList* list)
{
  free(list);
}

void CircleList_Clear(CircleList* list)
{
  TCircleList* sList = (TCircleList*)list;
  
  if(sList !=NULL)
  {
    sList->length = 0;
    sList->header.next = NULL;
    sList->slider = NULL;
  }
}

int CircleList_Length(CircleList* list)
{
  TCircleList* sList = (TCircleList*)list;
  int ret = -1;
  
  if(sList !=NULL)
  {
    ret = sList->length;
  }
  
  return ret;
}

int CircleList_Insert(CircleList* list,CircleListNode* node,int pos)
{
  TCircleList* sList = (TCircleList*)list;
  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)
{
  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)
{
  TCircleList* sList = (TCircleList*)list;
  CircleListNode* ret = NULL;
  int i = 0;
  
  if((sList != NULL) && (pos>=0))
  {
    CircleListNode* current = (CircleListNode*)sList;
    CircleListNode* first = sList->header.next;
    CircleListNode* last = (CircleListNode*)CircleList_Get(sList,sList->length-1);
    
    for(i = 0;i<pos;i++)
    {
      current = current->next;
    }
    
    ret = current->next;
    current->next = ret->next;
    
    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++)
    {
      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 */

typedef struct Value
{
  CircleListNode header;
  int v;
}value;

int main(int argc, char *argv[])
{
  int i=0;
  CircleListNode* list = CircleList_Create();
  
  value v1;
  value v2;
  value v3;
  value v4;
  value v5;
  value v6;
  value v7;
  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++)
  {
    value* pv = (value*)CircleList_Get(list,i);
    
    printf("%d\n",pv->v);
  }
  
  printf("\n");
  
  while(CircleList_Length(list)>0)
  {
    value* pv = (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++)
  {
    value* pv = (value*)CircleList_Next(list);
    
    printf("%d\n",pv->v);
  }
  
  CircleList_Reset(list);//重置链表
  
  //解决约瑟夫环问题
  printf("约瑟夫环问题：\n"); 
  
  while(CircleList_Length(list)>0)
  {
    value* pv = NULL;
    
    for(i=1;i<3;i++)
    {
      CircleList_Next(list);
    }
    
    pv = (value*)CircleList_Current(list);
    
    printf("%d\n",pv->v);
    
    CircleList_DeleteNode(list,(CircleListNode*)pv);
  }
  
  CircleList_Destory(list);
  
  return 0;
}