开始刷leetcode day 16：Reorder List

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}.

Java:

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public void reorderList(ListNode head) {
        if(head == null || head.next == null) return;
        ListNode fast = head;
        ListNode slow = head;
        
        while(fast.next != null && fast.next.next != null)
        {
            slow = slow.next;
            fast = fast.next.next;
        }
        ListNode head2 = slow.next;
        slow.next = null;
        ListNode reverse = null;
        while(head2!= null)
        {
            ListNode temp = head2.next;
            head2.next = reverse;
            reverse = head2;
            head2 = temp;
        }
        while(reverse != null  )
        {
            ListNode temp = head.next;
            head.next = reverse;
            reverse = reverse.next;
            head.next.next = temp;
            head = temp;
        }
    }
}

注意： slow.next = null;  需要将之前的链表的中间以后指向null