剑指 Offer II 024. 反转链表
给定单链表的头节点 head
,请反转链表,并返回反转后的链表的头节点。
示例 1:
输入:head = [1,2,3,4,5]
输出:[5,4,3,2,1]
示例 2:
输入:head = [1,2]
输出:[2,1]
示例 3:
输入:head = []
输出:[]
class Solution {
public:
ListNode* reverseList(ListNode* head) {
ListNode* phead = nullptr;
ListNode* qhead = head;
while(qhead)
{
ListNode* next; //与前面的层次打印二叉树相似,需要暂存节点
next = qhead->next;
qhead->next = phead;
phead = qhead;
qhead = next;
}
return phead;
}
};