剑指offer（12）-反转链表

题目描述

---

输入一个链表，反转链表后，输出链表的所有元素。

代码

---

/*struct ListNode {    int val;    struct ListNode *next;    ListNode(int x) :            val(x), next(NULL) {    }};*/class Solution {public:    ListNode* ReverseList(ListNode* pHead) {        ListNode* pReversedHead = NULL;        ListNode* pNode = pHead;        ListNode* pPrev = NULL;        while (pNode != NULL){            ListNode* pNext = pNode->next;            if(pNext == NULL){                pReversedHead = pNode;            }            pNode->next = pPrev;            pPrev = pNode;            pNode = pNext;        }        return pReversedHead;    }};