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 …

题目链接：

---

思路分析

将链表中奇数位置连续排列，然后接上偶数位置。

遍历链表，在遍历的同时重置next的位置，我感觉链表题的过程比较适合画出来，找到循环操作里需要操作的东西。

代码

/**
 * 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 || head->next == NULL)
            return head;
        ListNode* odd = head;
        ListNode* even = head->next;
        ListNode* evenhead = head->next;
        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;
    }
};

时间复杂度：$O(n)$
空间复杂度：$O(1)$

---

反思

因为head->next已经变了，只有一个头是可以用的，所以事先要保存一个evenhead头，这样程序才能正常进行。