就是利用数组保存了链表的节点,进行移位操作
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def reorderList(self, head: ListNode) -> None:
"""
Do not return anything, modify head in-place instead.
"""
if head is None:
return head
list=[]
node = head
while node:
list.append(node)
node=node.next
i,j=0,len(list)-1
while i<j:
list[i].next=list[j]
i+=1
if i==j:
break
list[j].next=list[i]
j-=1
list[i].next=None