建立任意一个含n个结点的单向链表，再将所建立的链表按逆序排列，即将链头当链尾，链尾当链头。

#include<iostream.h>
#include<iomanip>
using namespace std;
template<class T>
class sqlist
{private:
T *elem;
int curren;
int maxlen;
public:
sqlist(int maxsz=100):maxlen(maxsz){
curren=0;
elem=new T[maxlen];
};
sqlist(T a[],int n,int maxsz=100):maxlen(maxsz)
{ curren=n;
elem=new T[maxlen];
for(int i=0;i<n;i++)
elem[i]=a[i];
}
~sqlist(){delete[] elem;}
void clear(){curren=0;}
int leng(){return curren;}
int loct(T& el);
bool inst(int loc,T& el);
void dele(int loc);
bool full(){return curren==maxlen;}
bool empt(){return curren==0;}
void gete(int i);
void delejk(int j,int k);
void delex(T f);
void inver();
};
template<class T>
in