#include <stdio.h>
#include "head.h"
#include "1.h"


int main() 
{
    Linklist L;
    int n;
    printf("請(qǐng)輸入約瑟夫環(huán)中的人數(shù)：");
    scanf("%d",&n);
    Createlist(L,n);
    printf("創(chuàng)建的約瑟夫環(huán)為：\n");
    Listtrave(L,n);
    printf("依次出局的結(jié)果為：\n");
    Solution(L,n);
    return 0;
}

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



typedef int Elemtype;
typedef struct LNode{
    Elemtype data;
    struct LNode *next;
}LNode,*Linklist;

void Createlist(Linklist &L,int n)
{
    Linklist p,tail;
    L = (Linklist)malloc(sizeof(LNode));
    L->next = L;//先使其循環(huán) 
    p = L;
    p->data = 1;//創(chuàng)建首節(jié)點(diǎn)之后就先給首節(jié)點(diǎn)賦值，使得后面節(jié)點(diǎn)賦值的操作能夠循環(huán) 
    tail = L;
    for(int i = 2;i <= n;i++)
    {
        p = (Linklist)malloc(sizeof(LNode));
        p->data = i;
        p->next = L;
        tail->next = p;
        tail = p;
    }
    printf("已生成一個(gè)長(zhǎng)度為%d的約瑟夫環(huán)！\n",n); 
}
void Listtrave(Linklist L,int n)//遍歷函數(shù) 
{
    Linklist p;
    p = L;
    for(int i = 1;i <= n;i++)
    {
        printf("%3d",p->data);
        p = p->next;
    }
    printf("\n");
}
int Solution(Linklist L,int n)
{
    Linklist p,s;
    p = L,s = L;
    int count = 1;
    while(L)
    {
        if(count != 3)
        {
            count++;p = p->next;//進(jìn)行不等于3時(shí)的移位 
        }
        else
        {
            Linklist q;
            q = p;//用q保存p所指的位置，方便進(jìn)行節(jié)點(diǎn)的刪除 
            if(s->next->data == s->data)//當(dāng)只有一個(gè)元素的時(shí)候 
            {
                printf("%3d\n",s->data);
                free(s);
                return OK;
            }
            else//當(dāng)有兩個(gè)及兩個(gè)以上的元素的時(shí)候 
            {
                count = 1;//先將count重置為1
                printf("%3d",p->data);//再打印出出局的值 
                while(s->next != p) 
                {
                    s = s->next;//將s移位到p的前驅(qū)節(jié)點(diǎn)處 
                }
                p = p->next;//使p指向自己的下一個(gè)節(jié)點(diǎn) 
                s->next = p;//進(jìn)行刪除 
                free(q);
            }
        }
    }
}

#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2