328. Odd Even Linked List

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){

            return null;
        }else if(head.next ==null){
            return head;
        }

        ListNode odd = new ListNode(0);
        ListNode oddCurr = odd;
        ListNode even = new ListNode(0);
        ListNode evenCurr = even;
        int counter = 0;
        ListNode tmp = head;
        while(tmp != null){

            counter ++;
            if(counter % 2 == 1){

                oddCurr.next = new ListNode(tmp.val);
                oddCurr = oddCurr.next;
            }else{

                evenCurr.next = new ListNode(tmp.val);
                evenCurr = evenCurr.next;
            }
            tmp = tmp.next;
        }

        oddCurr.next = even.next;

        return odd.next;

    }
}