约瑟夫环-单向循环链表

#include<iostream.h>
struct Node
{
int data;
struct Node *next;
};
int main()
{
int m,n;
cout<<"请输入m的值";
cin>>m;
cout<<"请输入n的值";
cin>>n;
Node *first,*last;
first=last=new Node;//生成第一个结点
first->data=1;
for(int i=2;i<n+1;i++)
{
Node *p=new Node;
p->data=i;
last->next=p;last=p;//链接结点
}
last->next=first;
int number=n;
Node *pre=last;
while(number>1)
{
for(int j=1;j<m;j++)
pre=pre->next;
Node *p=pre->next;
pre->next=p->next;
cout<<p->data<<" ";
delete p;
number--;
}
cout<<pre->data<<" ";
delete pre;
}本文出自 “梦里依稀” 博客，请务必保留此出处http://maple.blog.51cto.com/180963/29410