【LEETCODE】328- Odd Even Linked List [Python]

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

题意：

给一个单链表，把所有的奇节点和偶节点分组，偶节点跟在奇节点之后，

请注意我们在谈论这个节点数字而不是节点的值，尝试in place，空间复杂度O(1) ，时间复杂度O(nodes) 

例如：

Given 1->2->3->4->5->NULL,

return 1->3->5->2->4->NULL.

注意：

在奇偶组内，各数字要保持原来的顺序

第一个是奇数，第二个是偶数

Python

60ms

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def oddEvenList(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        if head is None: 
            return head
            
        odd = oddHead = head
        even = evenHead = head.next
        
        while even and even.next:
            odd.next = even.next
            odd = odd.next
            even.next = odd.next
            even = even.next
        odd.next = evenHead
        
        return oddHead

88ms

class Solution(object):
    def oddEvenList(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        
        if head is None:
            return None
        
        odd=oddhead=head
        even=evenhead=head.next
        
        while even and even.next:
            odd.next=odd.next.next
            odd=odd.next
            even.next=even.next.next
            even=even.next
        
        odd.next=evenhead
    
        return oddhead