循环链表实现约瑟夫问题

来源：互联网发布：apache用什么语言写的编辑：程序博客网时间：2024/05/22 11:51

#include <iostream>using namespace std;struct joseph{    int i;    joseph *next;}*rear;void joseph_math(int n, int k);int main(){    int n,k;    cin >> n >> k;    joseph_math(n, k);    return 0;}void joseph_math(int n, int k){    if (n >= 1)    {        joseph *rear = new joseph;        rear->i = 1;        rear->next = rear;        joseph *p;        for (int i = 1; i < n; i++)//构建循环链表        {            p = new joseph;            p->i = i + 1;            joseph *tmp = rear->next;            rear->next = p;            p->next = tmp;            rear = p;        }        while (rear->next->i != rear->i)        {            for (int i = 1; i < k; i++)            {                rear = rear->next;            }            cout << rear->next->i << endl;            joseph *tem = rear->next->next;            delete rear->next;            rear->next = tem;        }        cout << rear->i << endl;        delete rear;        rear = nullptr;    }}

0 0