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

# 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
        h = head
        l = []
        
        while h:
            l.append(h.val)
            h = h.next
        
        l1 = []
        l2 = []
        for i,val in enumerate(l):
            if i%2 == 0:
                l1.append(val)
            else:
                l2.append(val)
        final_l = l1+l2

        dummy = ListNode(0)
        current = dummy
        for i in final_l:
            current.next = ListNode(i)
            current = current.next
        return dummy.next