约瑟夫环问题

约瑟夫环是一个数学的应用问题：已知n个人（以编号1，2，3…n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。

#include<stdio.h>   
#include <stdlib.h>
typedef struct xNode
{
    int data;
    struct xNode *pNext;
}xNode;

xNode* create(int num)
{
    xNode *pHead,*p1,*p2;
    if (num<=0)
    {
        return NULL;
    }

    pHead = (xNode*)malloc(sizeof(xNode));
    pHead->data = 1;
    p1 = pHead;
    for (int i = 2 ; i <= num ;i++)
    {
        p2 = (xNode*)malloc(sizeof(xNode));
        p2->data = i;
        p1->pNext = p2;
        p1 = p2;
    }
    p1->pNext = pHead;
    return pHead;
}

int length(xNode *pHead)
{
    if (pHead == NULL)
    {
        return 0;
    }
    int len =1;
    xNode *p = pHead;
    while (p->pNext != pHead)
    {
        p = p->pNext;
        len++;
    }
    return len;
}

//从编号为k(1<=k<=n)的人开始报数，数到m的那个人出列；  
void linkOut(xNode *pHead,int k,int m)
{
    xNode *p,*p0;
    if (pHead == NULL)
    {
        printf("Empty\n");
        return;
    }
    //找到开始那个人
    p = pHead;
    while (p->data != k)
    {
        p = p->pNext;
    }

    while (p != p->pNext)
    {
        for (int i = 0 ; i < m ; i++)
        {
            p0 = p;
            p = p->pNext;
        }

        printf("%d ",p->data);
        p0->pNext = p->pNext;
        free(p);

        p = p0->pNext;
    }

    printf("%d ",p->data);
    free(p);
}


int main()
{
    xNode *pHead = create(10);
    linkOut(pHead,13,2);
    return 0;
}


output：5 8 1 4 9 3 10 7 2 6

也可以使用标准库容器模拟实现链表

#include <stdio.h>
#include <iostream>
#include <list>
using namespace std;


typedef struct linkNode
{
    int value;
    linkNode *pNext;
}linkNode;

int LastRemain(int n,int m)
{
    if (n <= 0 || m <=0)
    {
        return -1;
    }

    list<int> ilist;

    for (int i = 0 ; i < n;i++)
    {
        ilist.push_back(i);
    }

    auto it = ilist.begin();
    while(ilist.size() >1)
    {
        for (int i = 0; i < m;i++)
        {
            it++;
            if (it == ilist.end())
            {
                it = ilist.begin();
            }
        }
        cout<<(*it)<<ends;
        it = ilist.erase(it);
        if (it == ilist.end())
        {
            it = ilist.begin();
        }
    }

    cout<<ilist.front()<<ends;
    return ilist.front();
}
/*创建循环链表*/
linkNode* CreateLink(int n)
{
    if (n<=0)
    {
        return NULL;
    }
    linkNode* pHead = new linkNode;
    pHead->value = 0;

    linkNode *p1 = pHead;
    for (int i = 1; i < n;i++)
    {
        linkNode *p2 = new linkNode;
        p2->value = i;
        p1->pNext = p2;
        p1 = p2;
    }
    p1->pNext = pHead;

    return pHead;
}


int DeleteM(linkNode *pHead,int m)
{
    if (pHead == NULL || m <=0)
    {
        return -1;
    }
    linkNode *p = pHead;

    while (p != p->pNext)//直到剩下一个元素
    {
        linkNode *pf,*pn;
        for (int i = 0; i < m;i ++)
        {
            pf = p;
            p= p->pNext;

        }

        pn = p->pNext;
        cout<<p->value<<ends;
        delete p;
        pf->pNext = pn;
        p = pn;
    }
    int result = p->value;
    cout<<result<<ends;
    delete p;
    return result;
}

void test()
{
    LastRemain(10,1);
    cout<<endl;

    linkNode *pHead = CreateLink(10);
    DeleteM(pHead,1);

}