题解 | #链表的奇偶重排#

# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param head ListNode类 
# @return ListNode类
#
class Solution:
    def oddEvenList(self , head: ListNode) -> ListNode:
        # write code here
        if not(head and head.next):
            return head
        this = head
        odd = ListNode(this.val)
        this = this.next
        even = ListNode(this.val)
        this_odd = odd
        this_even = even

        this = this.next
        while this:
            this_odd.next = ListNode(this.val)
            this_odd = this_odd.next
            this = this.next
            if this:
                this_even.next = ListNode(this.val)
                this_even = this_even.next
                this = this.next
        this_odd.next = even
        return odd