单链表--就地逆置--C++实现

//以单链表作为存储结构，实现线性表的就地逆置。
#include
using namespace std;
struct Node
{
int data;
Node *next;
};
class LinkList {
public:
LinkList(int a[], int n);
~LinkList();
void inversion(Node *first);
Node *show(int n);
private:
Node *first, *s, *p;
};

//利用头插法定义一个单链表
LinkList::LinkList(int a[], int n)
{
first = new Node;
first->next = NULL;
for (int i = 0; i < n; i++)
{
s = new Node;
s->data = a[i];
s->next = first->next;
first->next = s;
}
}
// Destructor
LinkList::~LinkList()
{
Node *d;
while (first != NULL)
{
d = first;
first = first->next;
delete d;
}
}
void LinkList::inversion(Node *first)
{
Node *k, *q, *r;
k = first->next;
q = k->next;
r = first->next;
while (true)
{
if (q->next == NULL)
{
first->next = q;
q->next = r;
k->next = NULL;
break;
}
else
{
first->next = q;
k->next = q -> next;
q->next = r;
q = k->next;
r = first->next;
}
}
}
Node *LinkList::show(int n)
{
//define a pointer p of Node to save first location
Node *q;
q = first->next;
for (int i = 0;i < n;i++)
{
cout << q->data;
q = q->next;
}
return first;
}
int main()
{
int n;
int a[100];
cout << “how many number you will input?” << endl;
cin >> n;
cout << “input the number of the narry:” << endl;
for (int i = 0;i < n;i++)
{
cin >> a[i];
}

LinkList link = LinkList(a, n);

cout << "The sequence before the reverse sequence is:" << endl;
Node *f=link.show(n);
cout << endl;
link.inversion(f);
cout << "The sequence after the reverse sequence is:" << endl;
Node *t = link.show(n);
cout << endl;
system("pause");
return 0;

}