约瑟夫环问题，单循环链表C++解答

#include
using namespace std;
typedef struct LNode
{
int data;
struct LNode *next;
}LNode, *LinkList;
void Create(LinkList &L,int n)
{
int i = 1; LNode *r,*p;
L = new LNode;
L->next = NULL;
L->data = 1;//很重要，去掉这一步，后面不能通过i=1的赋值方式来给链表赋值。
r = L;
for (i = 2; i <=n; i++)
{
p = new LNode; p->data = i; p->next = NULL; r->next = p; r = p;
}
r->next = L;//必不可少
}
void Joseph(LinkList &L, int n,int m)
{
int j = 1, i, k = 0;//k是死亡人数
LinkList q, t;
q = L;
cout << “自杀者顺序：”;
while (n - k > m)
{
if (j != 2) { j++; q = q->next; }
if (j == 2) { t = q->next; j = 1; q->next = t->next; cout << t->data << ‘\t’, delete t, q = q->next; k++; }
}
cout << endl;
cout << “留下的人的位置:” << endl;
for (i = 0; i <= m; i++) { cout << q->data << ‘\t’; q = q->next; i++; }

}

int main()
{
LinkList L; L = new LNode;
int m, n;
cout << “输入m、n:”;
cin >> m >> n;
Create(L, n);
Joseph(L, n,m);
system(“pause”);
return 0;
}//