C语言-实现约瑟夫环

链式解法：

#include <stdio.h>
#include <stdlib.h>

typedef struct sqlist
{
    int data;
    struct sqlist *next;
} SqList;

//创建解约瑟夫环需要的链表，该链表不带头节点
SqList *CreatList(int Length)
{
    SqList *head, *p, *temp;
    int i = 0;
    //先创建普通链表
    head = (SqList *)malloc(sizeof(SqList)), head->data = -1; //为创建链表方便，暂时加上头结点
    p = head;

    if (0 == Length)
        return;
    for (i = 1; i <= Length; i++)
    {
        p->next = (SqList *)malloc(sizeof(SqList));
        p = p->next;
        p->data = i;
    }
    p->next = NULL;
    /*普通链表转不带头结点的循环链表，就是将头指针下移到第一个节点位置
原来的头结点删掉，剩最后一个节点的判断条件就是head == head->next*/
    temp = head;          //先保存下来头结点，之后删除用
    p->next = head->next; //头尾链接
    head = head->next;    //头结点下移
    free(temp);           //释放头节点
    return head;          //返回链表头
}