题目描述
输入一个链表,反转链表后,输出链表的所有元素。
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};*/
class Solution {
public:
//直接看代码吧
ListNode* ReverseList(ListNode* pHead) {
if (pHead == nullptr)
return nullptr;
ListNode* pBack = pHead->next;
ListNode* pPre = nullptr;
while (pBack != nullptr)
{
pHead->next = pPre;
pPre = pHead;
pHead = pBack;
pBack = pHead->next;
}
pHead->next = pPre;
return pHead;
}
};