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

C++ / java见原文 细语呢喃 > leetcode Odd Even Linked List

本文是leetcode 328 Odd Even Linked List 的题解，更多题解可见 http://www.hrwhisper.me/leetcode-algorithm-solution/

class Solution(object):
    def oddEvenList(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        if not head: return head
        p, q = head, head
        while q:
            q = q.next
            if not q or not q.next: break
            next_p, next_q = p.next, q.next
            q.next = next_q.next
            p.next ,next_q.next = next_q , next_p
            p = p.next
        return head