[leetcode 中等 链表]143. 重排链表

题目描述

给定一个单链表 L：L0→L1→…→Ln-1→Ln ，
将其重新排列后变为： L0→Ln→L1→Ln-1→L2→Ln-2→…

你不能只是单纯的改变节点内部的值，而是需要实际的进行节点交换。

示例 1:

给定链表 1->2->3->4, 重新排列为 1->4->2->3.
示例 2:

给定链表 1->2->3->4->5, 重新排列为 1->5->2->4->3.

node存储到ArrayList里

class Solution {
    public void reorderList(ListNode head) {
       if(head == null || head.next == null) return;

        List<ListNode> list = new ArrayList<>();
        ListNode node = head;

        while(node != null){
            list.add(node);
            node = node.next;
        }

        int i=0, j=list.size()-1;
        while(i<j){
            list.get(i).next = list.get(j);
            i++;
            if(i==j) break;

            list.get(j).next = list.get(i);
            j--;         
        }
        list.get(i).next = null;
    }
}

寻找中间节点+反转链表+合并链表

class Solution {
    public void reorderList(ListNode head) {
        if (head == null) {
            return;
        }
        ListNode mid = middleNode(head);
        ListNode l1 = head;
        ListNode l2 = mid.next;
        //中间节点是最后一个节点 所以最后一个节点之后应该为null
        mid.next = null;
        l2 = reverseList(l2);
        mergeList(l1, l2);
    }

    public ListNode middleNode(ListNode head) {
        ListNode fast = head;
        ListNode slow = head;
        while(fast.next!=null && fast.next.next != null ){
            slow = slow.next;
            fast = fast.next.next;
        }
        return slow;
    }

    public ListNode reverseList(ListNode head) {
        if(head==null||head.next==null) return head;
        ListNode prev = reverseList(head.next);
        head.next.next=head;
        head.next=null;
        return prev;
        
    }

    public void mergeList(ListNode l1, ListNode l2) {
        ListNode l1_tmp;
        ListNode l2_tmp;
        while (l1 != null && l2 != null) {
            l1_tmp = l1.next;
            l2_tmp = l2.next;

            l1.next = l2;
            l1 = l1_tmp;

            l2.next = l1;
            l2 = l2_tmp;
        }
    }
}