Given a singly linked list L: L0→L1→…→Ln-1→Ln,
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…
You must do this in-place without altering the nodes' values.
For example,
Given {1,2,3,4}, reorder it to {1,4,2,3}.
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…
You must do this in-place without altering the nodes' values.
For example,
Given {1,2,3,4}, reorder it to {1,4,2,3}.
Subscribe to see which companies asked this question
思路:第一步先使用快慢指针找到一个链表的中间节点的指针。第二步将后半部分链表进行逆序。第三步合并前后两个链表,将后半部分链表插入到前半部分链表中。代码如下
比较多,可能写的不是很简洁,有待优化。
/**
* 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||!head->next)
return;
ListNode *p=head;
ListNode *q=head;
ListNode *pre=NULL;
while(true)
{
if(!q||!q->next)
break;
pre=p;
p=p->next;
q=q->next->next;
}
pre->next=NULL; //前半部分链表
//p指向的是链表的中间指针,将链表的后半部分进行逆序
pre=NULL;
while(p)
{
ListNode *tmp=p->next;
p->next=pre;
pre=p;
p=tmp;
}
//pre存放的是后半部分链表逆序后的起始节点,现在就是将前后两半的链表进行合并
p=head;
q=pre;
while(p&&q)
{
ListNode *tmp=p->next;
ListNode *tmp2=q->next;
p->next=q;
q->next=tmp;
pre=q;
p=tmp;
q=tmp2;
}
if(q)
pre->next=q;
return;
}
};