[leetcode] 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 ...

解法一：

先考虑三个corner case，即list为NULL，或者只含有一个或者两个node，直接返回head。

借用辅助的node，odd_tail，even_head，even_tail，其实每次就是将even_tail后面的一个node放到odd的末尾，后面的第二个node放到even的末尾，然后将odd的tail指向even的head。

/**
 * 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) return head;
        if(!head->next) return head;
        if(!head->next->next) return head;
        
        ListNode* odd_tail = head;
        ListNode* even_head = head->next;
        ListNode* even_tail = head->next;
        while(even_tail && even_tail->next){
            odd_tail->next = even_tail->next;
            even_tail->next = even_tail->next->next;
            odd_tail->next->next = even_head;
            odd_tail = odd_tail->next;
            even_tail = even_tail->next;
        }
        return head;
        
    }
};