数据结构之线性表---循环链表

单链表的局限： 
单链表可以用于表示任意的线性关系。 
有些线性关系是循环的，即没有队尾元素。

循环链表的定义

将单链表中最后一个数据元素的next指针指向第一个元素。

循环链表的操作

循环链表拥有单链表的所有操作： 
甚至有的操作在代码上完全相同

下面的相同： 
创建链表 
销毁链表 
获取链表长度 
清空链表 
获取第pos个元素操作

插入元素到位置pos，若在头部第一个元素和尾部最后一个元素插入时，做成循环。 
删除位置pos处的元素，若删除头部第一个元素和尾部最后一个元素，也要做成循环。

游标的定义：

在循环链表中可以定义一个“当前”指针：slider，这个指针通常称为游标，可以通过这个游标来遍历链表中的所有元素。

循环链表的新操作： 
获取当前游标指向的数据元素 
将游标重置指向链表中的第一个数据元素 
将游标移动指向到链表中的下一个数据元素 
直接指定删除链表中的某个数据元素

//循环链表头文件 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;

struct Value  //此结构题的定义应当在main.c文件中
{
    CircleListNode header;
    int v;
};

CircleList* CircleList_Create() // O(1) 创建循环链表
{
    TCircleList* ret = (TCircleList*)malloc(sizeof(TCircleList)); 
    if( ret != NULL )
    {
        ret->length = 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;
        sList->header.next = NULL;
        sList->slider = NULL;
    }
}

int CircleList_Length(CircleList* list) // O(1)  获取循环列表长度
{
    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)    //线性表的长度为0 首尾相接
        {
            slist->slider = node;
        }
        slist->length++;


        if(current == (CircleListNode*)slist)  //检查是不是插入的是第一个位置 for不会执行
        {
          CircleListNode *last = CircleList_Get(slist,slist->length-1);
          last->next = current->next;
        }


     }
     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) //删除一个数据元素
{
    TCircleList* slist = (TCircleList*)list;
    CircleListNode* ret = NULL;
    int i=0;
    if((slist!=NULL)&&(pos>=0)&&(pos<slist->length))
    {
       CircleListNode* current = (CircleListNode*)slist;
       CircleListNode* first = slist->header.next;   //第一个元素
       CircleListNode* last = NULL; //指向最后一个元素
       for(i=0;i<pos;i++)
       {
           current = current->next;
       }
      ret = current->next;
      current->next = ret->next;


      if(current == (CircleListNode*)slist)  //如果当前位置的是头链表
      {
          last = (CircleListNode*)CircleList_Get(slist,CircleList_Length-1);
      }
      if(last != NULL)
      {
         slist->header.next = ret->next; //头指针指向下一个元素
         last->next = ret->next; //最后一个元素指向第一个元素
      }
      if(slist->slider == ret)//如果删除的是结点
      {
         slist->slider = ret->next; //结点指向下一个元素
      }
      if(slist->length == 0 ) //如果长度为0
      {
        slist->header.next = NULL;
        slist->slider = NULL;
      }
      slist->length--;
    }
    return ret;
}

CircleListNode* CircleList_DeleteNode(CircleList* list, CircleListNode* node) // O(n) 
//这个删除函数的参数是要删除节点的地址，是一个指针，但功能与上一个函数相同
{
    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) // O(1) 游标复位函数，游标指向第一个元素
{
    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) // O(1) 返回游标当前指向的元素的指针
{
    TCircleList* sList = (TCircleList*)list;
    CircleListNode* ret = NULL;

    if( sList != NULL )
    {
        ret = sList->slider;
    }   
    return ret;
}

CircleListNode* CircleList_Next(CircleList* list) // O(1) 
//返回游标当前的指向位置，然后把游标向下移动一个元素
{
    TCircleList* sList = (TCircleList*)list;
    CircleListNode* ret = NULL;

    if( (sList != NULL) && (sList->slider != NULL) )
    {
        ret = sList->slider;
        sList->slider = ret->next;
    }   
    return ret;
}

约瑟夫问题求解

n 个人围成一个圆圈，首先第 1 个人从 1 开始一个人一个人顺时针报数，报到第 m 个人，令其出列。然后再从下一 个人开始从 1 顺时针报数，报到第 m 个人，再令其出列，…，如此下去，求出列顺序。

代码编写如下：

int main() 
{
    CircleList* list = CircleList_Create();

    int index = 0;
    int i = 0;
    int m = 3;

    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, 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));    

    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);

    //本程序 到 m = 3 时报数, 结果：3 6 1 5 2 8 4 7  

    return 0;
}