数据结构(二)单链表的逆序(带头节点)

//带头节点的 
#include <iostream>


using namespace std;


struct Node
{
int data;
struct Node *next;
};
//尾插法 
struct Node *create(int n)
{
struct Node *head,*p1,*p2;
int data;
p1 = p2 = NULL;
head = new Node();
head->next=NULL;
p2 = head;
cout<<"请输入数据\n";
for(int i=0;i<n;i++)
{
p1 = new Node();
cin>>data;
p1->data = data;
p1->next = NULL;
p2->next = p1;
p2 = p1;
}
return head;
}
//链表的输出 
void output(struct Node *head)
{
struct Node *p1;
p1 = head->next;
while(p1!=NULL)
{
cout<<p1->data<<" ";
p1 = p1->next;
}
cout<<"\n";
}
//链表的逆序 ------不使用额外的空间
void invert(struct Node *head)
{
struct Node *p1,*p2;
p1 = head->next;
head->next = NULL;
while(p1!=NULL)
{
p2 = p1;
p1 = p1->next;
p2->next = head->next;
head->next = p2;
}
} 
int main()
{
struct Node *head;
int n;
cout<<"链表的长度: ";
cin>>n;
head = create(n);
invert(head);
output(head);
return 0;
}