反转链表

代码：

// by nby

#include<iostream>
using namespace std;


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


// 创建链表 无头节点
node *Create()
{
node *head = new node;
node *pp = head;
int data[] = { 2, 4, 6, 8 };
for (int i = 0; i < sizeof(data) / sizeof(data[0]); i++)
{
node *p = new node;
p->data = data[i];
pp->next = p;
pp = pp->next;
}
pp->next = NULL;
pp = head->next;
delete head;
return pp;
}


// 打印链表各节点
void Cout(node *head)
{
node *p = head;
while (p != NULL)
{
cout << p->data << " ";
p = p->next;
}
}


//反转单链表
node *fanzhuanlist(node *head)
{
node *ph = NULL;
node *pr = NULL;
node *p1 = head;
node *p2 = NULL;
while (p1 != NULL)
{
p2 = p1->next;
if (p2 == NULL)
ph = p1;
p1->next = pr;
pr = p1;
p1 = p2;
}
return ph;
}


int main()
{
node *p = Create();
Cout(p);
cout << endl;
node *pf = fanzhuanlist(p);
Cout(pf);
cout << endl;


}