题目描述
输入一个链表,反转链表后,输出新链表的表头。
class Solution {
public:
ListNode* ReverseList(ListNode* pHead) {
ListNode* pre = NULL;
while(pHead) {
ListNode* next = pHead->next;
pHead->next = pre;
pre = pHead;
pHead = next;
}
return pre;
}
};