约瑟夫环的c++实现

//约瑟夫环
#include<iostream>
using namespace std;
template<class T>
struct Node   //结点结构
{
   
   
	T data;   //结点数据
	Node<T> *next;
};
template<class T>
class linklist//循环链表
{
   
   
	Node<T> *current, *front;
public:
	linklist() :current(NULL), front(NULL) {
   
   }//无参构造
	linklist(T a[], int maxsize)//有参构造
	{
   
   
		int i;
		Node<T> *p;
		current = new Node<T>;
		current->data = a[maxsize - 1];
		front = current;
		for (i = maxsize - 2; i >= 0; i--)//前移
		{
   
   
			p = new Node<T>;
			p->data = a[i];
			p->next = current;
			current = p;
		}
		front->next = current;
	}
	~linklist();//析构
	bool insert(T &x);//插入
	T Delete(T &x);//删除
	void Output();//输出元素
	bool toLocatioin