Leetcode May Challenge - 05/16: 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.

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

例子

Example 1:

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

Example 2:

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

解释

给一个链表，把奇数位置的元素放在前面，偶数位置的元素放在后面。要求时间复杂度在O(Nodes)然后不使用额外空间。

思路

不使用额外空间，我们就不能用最直接的方法：先存成list，奇偶分开，在存成链表。
所以我们用两个新的链表头部odd和even，然后遍历head，如果是奇数位置就放到odd里，否则放到even里。最后再把odd和even连接起来即可。

代码

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution(object):
    def oddEvenList(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        e1 = even = ListNode(0)
        o1 = odd = ListNode(0)
        i = 1
        while head:
            if i % 2 == 1:
                odd.next = head
                odd = odd.next
            else:
                even.next = head
                even = even.next
            i += 1
            head = head.next
        odd.next = e1.next
        even.next = None
        return o1.next