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}
.
解决思路:题目的意图是把倒数第一个插入到第一个结点的后面,倒数第二个插入到第二个结点的后面,依此类推。把一条链从中间打断,对第二条链进行翻转链表,然后依此插入到第一个链表中。(Time: 68s)
/**
* 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) return;
ListNode* pNode1=head;
int n=1;
while(pNode1!=NULL)
{
pNode1=pNode1->next;
n++;
}
if(n%2 == 0)
n=n/2;
else
n=n/2+1;
pNode1=head;
for(int i=0; i<n-1 ;++i)
{
pNode1=pNode1->next;
}
ListNode *tmpNode=pNode1->next;
pNode1->next=NULL;
ListNode *newHead=NULL;
newHead = ReverseNode(tmpNode);
pNode1=head;
ListNode *nextNode1=pNode1->next;
ListNode *pNode2=newHead;
ListNode *nextNode2=pNode2;
while(nextNode2 != NULL)
{
pNode2=nextNode2;
nextNode2=nextNode2->next;
pNode1->next=pNode2;
pNode2->next=nextNode1;
pNode1=nextNode1;
nextNode1=nextNode1->next;
}
return;
}
ListNode *ReverseNode(ListNode *nHead)
{
ListNode *pNode=nHead;
ListNode *prev=NULL;
ListNode *nNext=NULL;
while(pNode!=NULL)
{
nNext=pNode->next;
pNode->next=prev;
prev=pNode;
pNode=nNext;
}
nHead=prev;
return nHead;
}
};