题解 | 链表的奇偶重排

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
        if(head == null) return head;
        ListNode even = head.next;
        ListNode odd = head;
        ListNode evenhead = even;
        while(even != null && even.next != null){
            odd.next = even.next;
            odd =  odd.next;
            even.next = odd.next;
            even = even.next;
        }
        odd.next = evenhead;
        return head;
    }
}

嗯 其实看着很复杂但是思路是很简单 想象出链表奇偶交换位置的过程就发现可以很轻松的ac这道题