用循环单链表实现约瑟夫环

struct LNode{
  int data;
  LNode *next;
};

//n为总人数，k为第一个开始报数的人，m为出列者喊到的数
void solve(int k,int m, int n)
{
   if(k>n || n<=0 || m<=0)
    {
       throw "Invalid argument(s)";
     }

//建立循环链表
   LNode *p = new LNode;
   p->data = 1;
   p->next = p;

   LNode *curr = p;

   for(int i=2;i<=n;i++)
   {
      LNode *q = new LNode;
      q->data = i;
      p->next = q;
      q->next = curr;
      p=p->next;
   }

//把当前指针移动到第一个报数的人
   while(--k)
   {
      curr = curr->next;
   }
    LNode *pre;
    int m1=m;
   while(n--)
   {
     while(--m1)
       {
         pre = curr;
         curr = curr->next;
        }
      m1 = m;
      cout<<curr->data<<" ";
      pre->next = curr->next;
     delete curr;
      curr = pre->next;
   }

}

int main()
{
    solve(2,2,4);
    return 0;
}