输入一个链表,反转链表后,输出新链表的表头。
题目链接
题目思路:
1、设置三个节点,分别代表当前节点(cur)、前序节点(p)、后序节点(pp)。
2、对每个节点转换链表连接方向
pp = cur->next; //pp保存当前节点下一个节点
cur->next = p; //将当前节点cur的next节点链接到前序节点p
p = cur; //向后推进链表节点位置
cur = pp; //向后推进链表节点位置
代码:
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};*/
class Solution {
public:
ListNode* ReverseList(ListNode* pHead) {
ListNode* cur = pHead;
if(pHead == NULL || pHead->next ==NULL) return pHead;
ListNode* p = NULL;
ListNode* pp = NULL;
while(cur!=NULL){
pp = cur->next;
cur->next = p;
p = cur;
cur = pp;
}
return cur;
}
};
典型错误:
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};*/
class Solution {
public:
ListNode* ReverseList(ListNode* pHead) {
ListNode* cur = pHead;
if(pHead == NULL || pHead->next ==NULL) return pHead;
ListNode* p = pHead->next;
ListNode* pp = p;
while(p){
pp = p;
pp->cur = cur;
cur = pp;
p = p->next;
}
return head;
}
};