约瑟夫环

#include <iostream>
using namespace std;

class Node
{
public:
    friend class List;
    Node *next;
//private:
    int data;
};

class List
{
public:
    List();                                 //创建链表
    ~List();                                //销毁链表
    void ClearList();     					//  清空链表
    Node  *Locate(int i);     				//搜索第i个元素的地址
    void Josephus(List  &a,int n,int m);	//约瑟夫环
    bool ListInsert(int i);
    void Reverse();
    void output();
private:
    Node *first;
    Node *last;
};

List::List()
{
    first= new Node;
    first->next=first;
}

void List::ClearList()
{
    Node *currentNode = NULL;
    while(first!=first->next)
    {
        currentNode=first->next;                 //保存被删结点
        first->next=currentNode->next;          //将头结点指针指向被删结点的下一结点
        delete currentNode;
    }
}

List::~List()
{
    ClearList();
    delete first;
    first=NULL;
}

Node *List::Locate(int i)
{
    Node *currentNode=first;
    Node *currentNodeBefore=NULL;
    for(int k=0;k<i;k++)
    {
        currentNodeBefore=currentNode;
        currentNode=currentNode->next;
    }
    return currentNode;
}

void List::Josephus(List  &a,int n,int m)
{
    Node *p=NULL;
    p=a.Locate(1);
    Node *pre=NULL;
    int i,j;
    for(i=0;i<n-1;i++)                                                          //执行n-1次
    {
            for(j=1;j<m;j++)                                                    //数m-1个人
                {
                    pre=p;p=p->next;                                        //使得当前为p,p前一人为pre
                }
            cout<<"出列的人是"<<p->data<<endl;
            pre->next=p->next;                                              //链接p的前一人(pre)和p的下一人
            delete p;                                                                 //释放p内存
            p=pre->next;                                                         //将前一人的下一个变为p
    }
}

bool List::ListInsert(int i)
{
    Node *currentNode=Locate(i);
    if(NULL==currentNode)
    {
        return false;
    }
    Node *newNode=new Node;
    newNode->data=i;
    newNode->next=currentNode->next;
    currentNode->next=newNode;

    /*currentNode->data=i;
    return true;
    ClearList();
    Node *newNode=new Node;
    Node *temp=new Node;
    if(i==1)
    {
        currentNode=first->next;
    }
    else
    {

    }*/
    return true;
}

void List::Reverse()
{
    Node *prevNode=first;
    Node *curNode=first->next;
    Node*nextNode=curNode->next;
    while(first!=curNode)
    {
        curNode->next=prevNode;
        prevNode=curNode;
        curNode=nextNode;
        nextNode=curNode->next;
    }
    first->next=prevNode;
}
void List::output()
{
    Node *currentNode=first->next;
    while(currentNode!=first)
    {
        cout<<currentNode->data<<' ';
        currentNode=currentNode->next;
    }
    cout<<endl;
}

int main()
{
    List Js;
    int i,n,m;
    cout<<"输入游戏者人数和报数间隔";
    cin>>n>>m;
    for(i=1;i<=n;i++)
    {
        Js.ListInsert(i);                     //形成约瑟夫环（环形链表）
    }
    Js.Reverse();
    Js.output();
    Js.Josephus(Js,n,m);
    return 0;
}