Reorder List leetcode java 走地牙

/*
思路是 1 2 3 4 —> {1 - 2} & {4 - 3}
      1 2 3 4 5 -> {1 2 3} & {5 4} 的合并
      所以第一步是把list 分成两个
      第二步是把后半个 逆转
      第三步是把两个list合并成一个
*/

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public void reorderList(ListNode head) {
        //先找到分界点；
        if(head == null || head.next == null) return;
        ListNode firstList = head;
        ListNode half = head;
        ListNode doubleHalf = head;
        while(doubleHalf.next != null && doubleHalf.next.next != null) {
            half = half.next;
            doubleHalf = doubleHalf.next.next;
        }
        ListNode secondList = half.next;
        half.next = null;
        secondList = reverse(secondList);
        //合并
        while(secondList != null) {
            ListNode temp1 = firstList.next;
            ListNode temp2 = secondList.next;
            firstList.next = secondList;
            secondList.next = temp1;
            firstList = temp1;
            secondList = temp2;
        }
        return;
    }
    //翻转list
    private ListNode reverse(ListNode node) {
        if(node == null || node.next == null) return node;
        ListNode first = node;
        ListNode second = node.next;
        while(second != null) {
            ListNode temp = second.next;
            second.next = first;
            first = second;
            second = temp;
        }
        node.next = null;
        return first;
    }
}