328. Odd Even Linked List java solutions

Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.

You should try to do it in place. The program should run in O(1) space complexity and O(nodes) time complexity.

Example:
Given 1->2->3->4->5->NULL,
return 1->3->5->2->4->NULL.

Note:
The relative order inside both the even and odd groups should remain as it was in the input. 
The first node is considered odd, the second node even and so on ...

Credits:
Special thanks to @DjangoUnchained for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

 

/**
 * 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 || head.next == null) return head;
        ListNode oddcur = head;
        ListNode evencur = head.next;
        ListNode oddhead = new ListNode(-1);
        ListNode evenhead = new ListNode(-1);
        oddhead.next = oddcur;
        evenhead.next = evencur;
        
        head = head.next;
        int count = 1;
        while(head.next != null){
            if(count%2 == 1){
                oddcur.next = head.next;
                oddcur = oddcur.next;
            }else{
                evencur.next = head.next;
                evencur = evencur.next;
            }
            count++;
            head = head.next;
        }
        evenhead = evenhead.next;
        evencur.next = null;//这里偶链需要特殊处理，防止链循环。否则内存超出
        oddcur.next = evenhead;
        return oddhead.next;
    }
}

奇链串在一起，偶链串在一起，再拼起来 就是答案了。