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

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.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* oddEvenList(ListNode* head) {
        if (!head || !head->next) return head ;
        ListNode* h , *p = head , *tail = head ;
        int n = 0 ;
        while ( tail->next ) {//  node amount and tail node
            n ++ ;
            tail = tail->next ;
        }
        n++ ;
        
        int k = 1 ;
        h = head ;
        while ( k <= n/2 ) { // 需要 n/2 次 转换
            k++ ;
            tail->next = h->next ;
            tail = h->next ;
            h->next = h->next->next ;
            tail->next = NULL ;
            h = h->next ; // h指向下一个“单数”节点
        }
        return 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 || !head->next) return head ;
        ListNode *h =head , *tail = head->next ,*even = head->next ;
        // 将基数节点 和偶数节点分别连在一起
        while ( h->next && tail->next ) {
            h->next = h->next->next ;
            tail->next = tail->next->next ;
            
            h = h->next ;
            tail = tail->next ;
        }
        h->next = even ; //将偶数链表接在基数链表后面
        return head ;
    }
};