单链表就地逆置

#include <iostream>

using namespace std;
typedef int T;

struct node
{
    T data;
    node *next;
};

class LinkList
{
public:
    LinkList();            //无参数的构造函数
    LinkList(T a[],int n); //有参数的构造函数
    void Reverse();        //单链表逆置函数；
    ~LinkList();
    void Print();          //单链表遍历函数
private:
    node *first;
};

LinkList::LinkList()
{
    first = new node;
    first -> next = NULL;
}
LinkList::LinkList(T a[],int n)//头插法建立单链表
{
    first = new node;
    node *s;
    first -> next = NULL;
    for(int i=0;i<n;i++){
        s = new node;
        s->data = a[i];
        s->next = first->next;
        first->next = s;
    }
}
void LinkList::Reverse()//单链表的逆置函数
{
    node *p,*q;
    p = first->next;
    first->next = NULL;
    while(p!=NULL){
        q = p->next;
        p->next = first->next;
        first->next=p;
        p = q;
    }
}
void LinkList::Print()
{
    node *p;
    p = first->next;
    while(p!=NULL){
        cout<<p->data<<" ";
        p=p->next;
    }
    cout<<endl;
}
LinkList::~LinkList()
{
    node *q;
    while(first!=NULL){
        q = first;
        first = first->next;
        delete q;
    }
}

int main()
{
    int n = 10;
    T a[n];
    cout<<"输入10个数头插法建立链表"<<endl;
    for(int j=0;j<n;j++)
        cin>>a[j];
    LinkList s(a,n);         //声明S这个对象 调用有参数的构造函数；
    cout<<"头插法建立链表后遍历"<<endl;
    s.Print();
    s.Reverse();
    cout<<"链表就地逆置后的结果为"<<endl;
    s.Print();
}

单链表的就地逆置