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

public void reorderList(ListNode head) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        if(head == null || head.next == null) return;
        ListNode slow = head;
        ListNode fast = head;
        while(fast.next != null && fast.next.next != null) {
            slow = slow.next;
            fast = fast.next.next;
        }
        slow.next = reverse(slow.next);
        ListNode head1 = head;
        ListNode head2 = slow.next;
        while(head1 != slow) {
            ListNode next1 = head1.next;
            ListNode next2 = head2.next;
            head1.next = head2;
            head2.next = next1;
            slow.next = next2;
            head1 = next1;
            head2 = next2;
        }
    }
    
    public ListNode reverse(ListNode head) {
        if(head == null) return null;
        ListNode previous = head;
        while(head.next != null) {
            ListNode next = head.next;
            head.next = next.next;
            next.next = previous;
            previous = next;
        }
        return previous;
    }