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

# 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
        arr = []
        p = head
        while p:
            arr.append(p.val)
            p = p.next

        new_arr = arr[::2]+ arr[1::2]

        p = head
        i = 0
        while p:
            p.val = new_arr[i]
            i += 1
            p = p.next

        return head

同样使用数组来辅助解决，重排后直接写回去即可。