题目:
Given a singly linked list L: L 0→L 1→…→L n-1→L n,
reorder it to: L 0→L n →L 1→L n-1→L 2→L n-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}.
key:
1. 快慢指针 获得中点,分割成两个链表
2. 将后面一个链表反转
3.将反转后的链表插入到前一个链表里面