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

给一个链表，把所有奇数位置的结点放一起，偶数位置的结点放一起并排在奇数位置结点的后面（位置，位置！）

我遍历了两遍，第一遍存奇数位置的结点，第二遍存偶数位置的结点。时间复杂度O(n)，空间复杂度O(1)

/**
 * 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 NULL;
        ListNode* ans = new ListNode(0);
        ListNode* res = ans;
        ListNode* cur = head;
        int cnt = 0;
        while (cur) {
            cnt++;
            if (cnt % 2) {
                ans->next = new ListNode(cur->val);
                ans = ans->next;
            }
            cur = cur->next;
        }
        cur = head;
        cnt = 0;
        while (cur) {
            cnt++;
            if (cnt % 2 == 0) {
                ans->next = new ListNode(cur->val);
                ans = ans->next;
            }
            cur = cur->next;
        }
        return res->next;
    }
};

评论区有个做法。时间复杂度也是O(n)，但是人家只需要遍历一遍即可。

 ListNode* oddEvenList(ListNode* head) 
    {
        if(!head) return head;
        ListNode *odd=head, *evenhead=head->next, *even = evenhead;
        while(even && even->next)
        {
            odd->next = odd->next->next;
            even->next = even->next->next;
            odd = odd->next;
            even = even->next;
        }
        odd->next = evenhead;
        return head;
    }