题目描述:
已知有n个人围坐在一张圆桌上,编号依次为0,1,2,...n-1, 编号为n-1与编号为0的人坐在相邻的位置。现在编号为k的人从1开始报数,数到m的那个人会退出圆桌。他的下一个人又从1开始报数,数到m的那个人又出列。依此规律重复下去,请问最后出列的人的编号。
输入格式:
输入一行,包含三个整数n,k,m
输出格式:
输出一行,包含一个整数
#include<iostream>
using namespace std;
struct node
{
int date;
node *next;
};
class linklist
{
public:
linklist()
{
node *p = new node();
p->date = 1;
p->next = p;
first = p;
};
void josephus(int n,int k,int m);
private:
node *first;
};
void linklist::josephus(int n, int k, int m)
{
node *p=first;
for (int i = 2; i < n+1; i++)
{
node *q = new node();
q->date = i;
q->next = p->next;
p->next = q;
p = q;
}
//数到第k个节点,使其为当前节点
p = first;
node *temp = p; //这个temp初始值保证了第一次开始计数到m的第一个元素与其后各循环
删除元素起始点不一致情况下,循环体可正常运行。
while (--k)
p = p->next;
while (n--)
{
for (int i = 1; i < m; i++)
{
temp = p;
p = p->next;
}
//cout << p->date<<" ";
temp->next = p->next;
p = temp->next;
}
cout << p->date;
cout <<endl;
}
int main()
{
int n , k , m ;
cin >> n >> k >> m;
linklist L;
L.josephus(n, k, m);
//system("pause");
return 0;
}
在网上看到其他网友的写法:
include <iostream>
using namespace std;
struct MyNode
{
MyNode(int a_data):m_data(a_data),m_pNext(NULL) {}
int m_data;
MyNode *m_pNext;
};
class Josephus
{
public:
Josephus(int a_N, int a_K, int a_M):m_N(a_N),m_K(a_K),m_M(a_M)
{
createList();
outputList();
}
protected:
void createList();
void outputList();
private:
MyNode *m_pHead;//循环链表的头节点
int m_N; //链表节点个数
int m_K; //第一个报数人的序号
int m_M; //报数出局的数
};
void Josephus::createList()
{
MyNode *pre = NULL;
MyNode *cur = NULL;
MyNode *p = new MyNode(1);
m_pHead = p;
cur = p;
for (int i=2; i<=m_N; i++)
{
p = new MyNode(i);
pre = cur;
cur = p;
pre->m_pNext = cur;
}
cur->m_pNext = m_pHead;
int n=m_N;
p = m_pHead;
while (n--)
{
cout << p->m_data << ",";
p = p->m_pNext;
}
cout << endl;
}
void Josephus::outputList()
{
MyNode *pre = NULL;
MyNode *cur = m_pHead;
m_K;
while (m_K--) //寻找第K个人(开始报数的人)
{
pre = cur;
cur = cur->m_pNext;
}
while (m_N--) //输出链表中所有的节点值
{
int s = m_M-1;
while (s--) //寻找间隔M的人
{
pre = cur;
cur = cur->m_pNext;
}
MyNode *p = cur;
cout << p->m_data << ",";
cur = cur->m_pNext; //删除节点的过程
pre->m_pNext = cur;
delete p;
p=NULL;
}
}
int main()
{
Josephus josephus(4,1,3);
return 0;
}