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 ...

题意：对于一个链表，把位置是偶数的接在位置是奇数的位置后面（ps：位置的奇偶数，而不是节点元素的值的奇偶数）还要保持奇偶数位置上的元素的相对顺序不变。

解题思路：

把原链表分成两个链表，然后分别把位置为奇数的放在odd链表中，把位置为偶数的放在even中。

        最后把位置为偶数的链表接在位置为奇数链表的后面。

/**
 * 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 oddNode = head;
        ListNode evenNode = head.next;
        ListNode tmp = evenNode;
        while(evenNode != null && evenNode.next != null){
        	oddNode.next = evenNode.next;
        	oddNode = oddNode.next;
        	evenNode.next = oddNode.next;
        	evenNode = evenNode.next;
        }  
		oddNode .next = tmp;
		return head;
    }
}