题解 | #链表的奇偶重排#

import java.util.*;

/*
 * public class ListNode {
 *   int val;
 *   ListNode next = null;
 *   public ListNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * @param head ListNode类
     * @return ListNode类
     */
    public ListNode oddEvenList (ListNode head) {
        // write code here
        List<Integer> list = new ArrayList<Integer>();
        while (head != null) {
            list.add(head.val);
            head = head.next;
        }
        ListNode newHead = new ListNode(-1);
        ListNode node = newHead;
        for (int i = 0; i < list.size(); i += 2) {
            ListNode temp = new ListNode(list.get(i));
            node.next = temp;
            node = node.next;
        }
        for (int i = 1; i < list.size(); i += 2) {
            ListNode temp = new ListNode(list.get(i));
            node.next = temp;
            node = node.next;
        }
        return newHead.next;
    }
}