Odd Even Linked List

两根指针

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode oddEvenList(ListNode head) {
        if (head == null) {
            return null;
        }
        ListNode node = head;
        ListNode p1 = node;
        ListNode p2 = node.next;
        ListNode connectNode = node.next;
        while (p1 != null && p2 != null) {
            ListNode temp = p2.next;
            if (temp == null) {
                break;
            }
            p1.next = p2.next;
            p1 = p1.next;
            p2.next = p1.next;
            p2 = p2.next;
        }
        p1.next = connectNode;
        return node;
    }
}