leetcode #143. 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 may not modify the values in the list’s nodes, only nodes itself may be changed.

Example 1:

Given 1->2->3->4, reorder it to 1->4->2->3.
Example 2:

Given 1->2->3->4->5, reorder it to 1->5->2->4->3.

思路
1 运用快慢指针，将链表分为
2将后半部分链表直接颠倒
private ListNode reverseList(ListNode head){
ListNode prev = null;
ListNode next = null;

    while(head != null){
        next = head.next;
        head.next = prev;
        prev = head;
        head= next;
        
        
    }
    
    return prev;
    
}

3将两个链表拼接

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public void reorderList(ListNode head) {
        ListNode fast = head;
        ListNode slow = head;
        
        while(fast!= null && fast.next != null){
            fast = fast.next.next;
            slow = slow.next;
        }
        
        ListNode second = slow.next;// 将其分为两个链表
        slow.next = null;
        
        //反转链表2
         second = reverseList(second);
        
        
        //拼接两个链表构建新链表
        ListNode first = head;
        
        while(second != null){
            ListNode next = first.next;
            first.next = second;
            second = second.next;
            first = first.next;
            first.next = next;
            first = first.next;
        }
        
        
    }
    
    //反转列表方法
    private ListNode reverseList(ListNode head){
        ListNode prev = null;
        ListNode next = null;
        
        while(head != null){
            next = head.next;
            head.next = prev;
            prev = head;
            head= next;
            
            
        }
        
        return prev;
        
    }
}```