循环链表实现约瑟夫问题

最新推荐文章于 2024-07-22 20:42:27 发布

Aldenn

最新推荐文章于 2024-07-22 20:42:27 发布

阅读量214

点赞数

分类专栏： c++ 文章标签：链表约瑟夫问题

本文链接：https://blog.csdn.net/qq_33358469/article/details/69218587

版权

c++ 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

#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;
    }
}