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 1:

1 2	Input: 1->2->3->4->5->NULL Output: 1->3->5->2->4->NULL

Example 2:

1 2	Input: 2->1->3->5->6->4->7->NULL Output: 2->3->6->7->1->5->4->NULL

這題要求間隔尋訪list，先列出奇數linkedlist，後面再接偶數，我們知道串列尋訪用.next，先找出奇偶的頭(head, head.next)，再迴圈間隔串下一個(odd.next, even.next = even.next, odd.next)，最後把even串到odd後面。

如果你覺得這篇文章很棒，請你不吝點讚 (ﾟ∀ﾟ)