题目描述
输入一个链表,反转链表后,输出新链表的表头。
代码实现
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};*/
class Solution {
public:
ListNode* ReverseList(ListNode* pHead) {
if(pHead == NULL || pHead->next == NULL)
return pHead;
ListNode* pCurrent = ReverseList(pHead->next);
pHead->next->next = pHead;
pHead->next = NULL;
return pCurrent;
}
};