0. 题目
1. 线性表存储节点 o(n) o(n)
class Solution:
def reorderList(self, head):
if not head:
return
# 线性表存储节点
vec = list()
node = head
while node:
vec.append(node)
node = node.next
i, j = 0, len(vec) - 1
while i < j:
vec[i].next = vec[j]
i += 1
if i == j:
break
vec[j].next = vec[i]
j -= 1
#最后指向None
vec[i].next = None