Odd Even Linked List

转载于 2019-07-03 04:35:17 发布 · 888 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/sherylwang/p/5745776.html

文章标签：

#java #数据结构与算法

本文介绍了一种链表操作技巧，将链表中的奇数位置节点与偶数位置节点进行分离并重新组合，实现奇数节点在前，偶数节点在后的布局，同时保持各自相对顺序不变。通过两个独立链表的交替操作，最终达到O(1)空间复杂度和O(nodes)时间复杂度的目标。

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

奇数位置的listnode放到偶数位前面。

思路：1.奇数一个链表，偶数一个链表

2.奇数尾巴接偶数头（所有奇数尾巴一定不是None，提前判断，偶数尾巴一定要是None，防止环）。

代码如下：

class Solution(object):
    def oddEvenList(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        if not head or not head.next:
            return head
        first = head
        second = head.next
        curEven = second
        while (first.next and first.next.next) or (curEven.next and curEven.next.next):
            if first.next and first.next.next:
                first.next = first.next.next
                first = first.next
            if curEven.next and curEven.next.next:
                curEven.next = curEven.next.next
                curEven = curEven.next
        curEven.next = None
        first.next = second
        return head

简洁版本，变慢了，囧：

class Solution(object):
    def oddEvenList(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        if not head or not head.next:
            return head
        first = head
        second = head.next
        curEven = second
        while curEven and curEven.next:
                first.next = first.next.next
                curEven.next = curEven.next.next
                first = first.next
                curEven = curEven.next
        first.next = second
        return head