[剑指offer][面试题16]反转链表

#include <iostream>
using namespace std;

struct Node{
int   m_Data;
Node *m_pNext;
};

Node* reverseList(Node *pHead)
{
if (pHead==NULL){
return NULL;
}

if (pHead->m_pNext==NULL){
return pHead;
}

Node *pPrev = pHead;
Node *pCurr = pHead->m_pNext;
Node *pNext = NULL;
pPrev->m_pNext = NULL;
while (pCurr){
pNext = pCurr->m_pNext;
pCurr->m_pNext = pPrev;
pPrev = pCurr;
pCurr = pNext;
}

return pPrev;
}

void printList(Node *pHead)
{
bool bEmpty = true;

while (pHead){
bEmpty = false;
cout<<pHead->m_Data<<"->";
pHead = pHead->m_pNext;
}

if (!bEmpty){
cout<<"NULL"<<endl;
}
}

int main()
{
Node nodeA5 = {1, NULL};
Node nodeA4 = {2, &nodeA5};
Node nodeA3 = {3, &nodeA4};
Node nodeA2 = {4, &nodeA3};
Node nodeA1 = {5, &nodeA2};
Node nodeA0 = {6, &nodeA1};
Node *pHeadA = &nodeA0;

cout<<"Linked List: "<<endl;
printList(pHeadA);

pHeadA = reverseList(pHeadA);
cout<<"Reversed List: "<<endl;
printList(pHeadA);
}