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

class Solution:
    def oddEvenList(self, head: ListNode) -> ListNode:
        # write code here
        odd, even = [], []
        cur = head
        while cur:
            odd.append(cur.val)
            cur = cur.next
            if cur:
                even.append(cur.val)
                cur = cur.next
        res = cur = ListNode(0)
        while odd:
            cur.next = ListNode(odd.pop(0))
            cur = cur.next
        while even:
            cur.next = ListNode(even.pop(0))
            cur = cur.next
        return res.next