解析:本题考察快慢指针和链表反转
整体思路:
1.将整个链表划分为两部分:利用快慢指针,快指针每次走两步,慢指针每次走一步,最终慢指针所到达的位置就是链表划分的位置
2.将第二部分的链表反转(可以参考我之前的一篇博文)
3.将反转后的第二部分链表依次插入到第一部分的链表
注意:将反转链表插入到另外的链表中,特别需要注意保存反转链表的下一个节点[指针问题很难调试,哎~],多画图,多画图,多画图
fast = cur->next;
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
void reorderList(ListNode* head) {
if (head == NULL || head->next == NULL || head->next->next == NULL) return;
ListNode* prior = head;
ListNode* fast = head;
while (fast != NULL && fast->next != NULL){
prior = prior->next;
fast = fast->next->next;
}
ListNode* new_prior = new ListNode(-1); //分成两段链表
new_prior->next = prior->next;
prior->next = NULL;
prior = new_prior->next;
while (prior->next != NULL){ //翻转后面一段链表
fast = prior->next;
prior->next = fast->next;
fast->next = new_prior->next;
new_prior->next = fast;
}
prior = head;
ListNode* cur = new_prior->next;
while (cur != NULL){ //将后面一段链表拼接上前面一段
fast = cur->next; //保存下一个节点
cur->next = prior->next;
prior->next = cur;
prior = cur->next;
cur = fast;
}
}
};