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}
.
给定一个单链表L: L0→L1→…→Ln-1→Ln,
将其重排列为: L0→Ln→L1→Ln-1→L2→Ln-2→…
不能直接交换节点的值。
将结点存进vector后直接按顺序连接,代码如下:
/**
* 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) return ;
vector<ListNode*> iter;
ListNode *begin=head;
while(begin!=NULL)
{
iter.push_back(begin);
begin=begin->next;
}
int i=0;
int n=iter.size()-1;
while(n>i)
{
iter[i]->next=iter[n];
iter[n]->next=iter[++i];
iter[i]->next=iter[--n];
}
iter[i]->next=NULL;
}
};