c++实现链表反转

#include <iostream>
using namespace std;
typedef struct ListNode
{
int data;
ListNode *pNext;
}Node;
void print(Node *pHead)
{
if (pHead != NULL)
{
while (pHead->pNext != NULL)
{
cout << pHead->data;
pHead = pHead->pNext;
}
cout << pHead->data;
}
return;
}
void reverse(Node *&pHead)
{
if (pHead == NULL || pHead->pNext == NULL)
return;
Node *pre, *cur, *temp;
pre = pHead;
cur = pHead->pNext;
while (cur)
{
temp = cur->pNext;
cur->pNext = pre;
pre = cur;
cur = temp;
}
pHead->pNext = NULL;
pHead = pre;
//print(pHead);
}
int main()
{
Node p9{ 9, NULL };
cout << sizeof(p9);
Node p7{ 7, &p9 };
Node p5{ 5, &p7 };
Node p3{ 3, &p5 };
Node p1{ 1, &p3 };
ListNode *head = &p1;
cout << "原序列为：";
print(head);
cout << endl;
reverse(head);
cout << "逆置后序列为：";
print(head);
system("pause");
return 0;

}