list:reorder-List

给一个链表L: L 0→L 1→…→L n-1→L n,
重新排序为: L 0→L n →L 1→L n-1→L 2→L n-2→…
解析：
将链表以中间化分为两个部分，对后半部分反转，然后依次合并两个新链表

public class reorderList {
    public void reorderList(ListNode head) {
        if(head==null || head.next==null) {
            return ;
        }
         ListNode mid = getMiddele(head);
         ListNode midNext = mid.next;
         mid.next = null;

         ListNode head2 = reverseList(midNext);
         insertList(head,head2);


    }

    private void insertList(ListNode head, ListNode after) {
        // TODO Auto-generated method stub
        //ATTENTION!!!  多个变量指向同一个引用类型对象时候，只有一个变量发生改变，另一个变量随之发生改变
        //通常可以保存一个引用对象
        ListNode first = head;
        while(first != null && after != null) {
            ListNode ftemp = first.next;
            ListNode aftemp = after.next;
            first.next = after;
            first = ftemp;
            after.next = first;
            after = aftemp;
            }

}

    private ListNode reverseList(ListNode midNext) {
        // TODO Auto-generated method stub
        if(midNext==null || midNext.next==null)
            return midNext;
        else {
            ListNode nhead=midNext;
            nhead.next=null;
            ListNode cur = midNext.next;
            ListNode nxt=null;
            while(cur.next!=null) {
                nxt = cur.next;
                cur.next = nhead;
                nhead =cur;
                cur =nxt;
            }
            cur.next = nhead;
            return cur;
        }
    }

    public ListNode getMiddele(ListNode head) {
        // TODO Auto-generated method stub
        if(head==null || head.next==null) {
            return head;
        }
        ListNode slow=head,fast = head;
        while(fast.next!=null && fast.next.next!=null) {
            slow = slow.next;
            fast = fast.next.next;
        }
        return slow;
    }
}