转载于剑指Offer
题目:
输入一个链表,反转链表后,输出链表的所有元素。代码:
class Solution {
public:
ListNode* ReverseList(ListNode* pHead) {
ListNode* pReverseHead = NULL;
ListNode* pNode = pHead;
ListNode* pPrev = NULL;//创建3个指针为关键
while (pNode != NULL){
ListNode* pNext= pNode->next;
if (pNext == NULL)
pReverseHead = pNode;
pNode->next = pPrev;
pPrev = pNode;
pNode = pNext;
}
return pReverseHead;
}
};