反转链表

1 struct ListNode
2 {
3     int value;
4     ListNode *next;
5 };

 1 ListNode* Reverse(ListNode *pHead)
 2 {
 3     ListNode *pReverse = NULL;
 4     ListNode *pNode = pHead;
 5     ListNode *pPre = NULL;
 6 
 7     while(pNode){
 8         ListNode *pNext = pNode->next;
 9 
10         if(pNext==NULL)
11             pReverse = pNode;
12         
13         pNode->next = pPre;
14 
15         pPre = pNode;
16         pNode = pNext;
17     }
18     return pReverse;
19 }