输入一个链表,反转链表后,输出新链表的表头。
/*
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* ReverseRet = NULL;
ListNode* temp = NULL;
while(pHead)
{
temp = pHead->next;
pHead->next = ReverseRet;
ReverseRet = pHead;
pHead = temp;
}
return ReverseRet;
}
};