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

题意：给定一个单链表，要求用O(1)的空间复杂度和O(n)的时间度把链表的奇数节点连接在一起，偶数节点连接在一起并且最后一个奇数节点连接偶数节点。

分析：定义4个节点指针，一个指针指向奇数头节点，一个指向奇数尾节点，另外两个指针分别指向偶数头节点和最后一个偶数节点，最后把奇数尾节点的next指向偶数头节点变成一个单链表。

C++代码

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* oddEvenList(ListNode* head) {
        if(head==NULL)return head;
        ListNode* even = head->next;
        ListNode* odd=head;
        ListNode* oddhead=odd;
        ListNode* evenhead=even;
        head=head->next;
             while(head&&head->next)
            {    
                 head=head->next;
                 odd->next=head;
                 even->next=head->next;
                 head=head->next;
                 odd=odd->next;
                 even=even->next;
            }
             odd->next=evenhead;
            return oddhead;
    }
};