*********.CPP文件******* #include<iostream>#include"h.h"using namespace std;template<class T>linklist<T>::linklist(T a[],int n){ first=new Node<T> ; first->data=a[n-1]; first->next=first; int i; for( i=0;i<n-1;i++) {  Node<T> *s;  s=new Node<T>;s->data=a[i];  s->next=first->next;  first->next=s; }}template<class T>void linklist<T>::delate(){ Node<T> *p,*pre; pre=first,p=first->next; int count,m; count=2; cin>>m;    while(p!=pre) {  if (count==m)  {            cout<<p->data<<' ';      pre->next=p->next;delete p;p=pre->next;   count=1;  }  else p=p->next,pre=pre->next,++count; } cout<<p->data; first=p;} 主函数 #include<iostream>#include"ho.cpp"using namespace std;void main(){ cout<<"输入"; int a[]={1,2,3,4,5}; linklist <int> k(a,5); k.delate(); } 头文件 # ifndef h_H# define h_Htemplate<class T>struct Node{ T data; Node<T> *next;};template<class T>class linklist{public:       linklist(T a[],int n);       void delate();private:       Node<T> *first;};#endif

评论