链表逆置

#include<iostream>
using namespace std;

struct	Node
{
	int data;
	Node* next;
};

class LinkList
{
public:
	LinkList(int a[], int n);
	void printlist();
	void turn();
private:
	Node * first;
};

void LinkList::turn()
{
	Node*save, *change, *last;
	last = NULL;
	save = first->next;
	while (save != NULL)
	{
		change = save;
		save = save->next;
		change->next = last;
		last = change;
		cout << "change结点：" << change->data << endl;
	}
	first->next = last;
}
LinkList::LinkList(int a[], int n)
{
	Node* r;
	Node* s;
	first = new Node;
	r = first;
	for (int i = 0; i<n; i++)
	{
		s = new Node;
		s->data = a[i];
		r->next = s;
		r = s;
	}
	r->next = NULL;

}

void LinkList::printlist()
{
	Node *p;
	p = first->next;
	while (p != NULL)
	{
		cout << p->data << " ";
		p = p->next;
	}
	cout << endl;
}
int main()
{
	int a[10] = { 0,1,2,3,4,5,6,7,8,9 };
	LinkList obj = LinkList(a, 10);
	obj.printlist();
	obj.turn();
	obj.printlist();
	system("pause");
	return 0;
}