题目:
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}
.
/**
* 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*> vec;
ListNode* node = head;
while(node!=NULL)
{
vec.push_back(node);
node = node->next;
}
int left=0, right=vec.size()-1;
while(left<right)
{
vec[left]->next = vec[right];
vec[right]->next = vec[left+1];
left++; right--;
}
vec[left]->next = NULL;
}
};