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

class Solution:
    def oddEvenList(self , head: ListNode) -> ListNode:
        # write code here
        
        list=[]
        list_j=[]
        list_o=[]
        list_sum=[]
        
        if not head:
            return None
        while head:
            list.append(head.val)
            head=head.next
            
        l=len(list)
        for i in range(l):
            if i%2==0:
                list_j.append(list[i])
            else:
                list_o.append(list[i])
        list_sum=list_j+list_o
        cur=lend=ListNode(list_sum[0])
        for j in range(1,len(list_sum)):
            cur.next=ListNode(list_sum[j])
            cur=cur.next
        return lend