<p>你的问题不是100%清楚:你是不是想把链表一分为二,开头是奇数,结尾是偶数?您是否试图在不考虑值本身的情况下对列表进行分区?你知道吗</p>
<p>另外,一定有一些代码,你还没有提交你的问题…我已经采取了我的最佳猜测,可能是什么样的代码。你知道吗</p>
<p>下面的代码段将返回所需的输出:</p>
<pre><code>class Node:
def __init__(self, value):
self.value = value
self.next_node = None
class Linkedlist:
def __init__(self, L=None):
self.head = Node(L[0])
current = self.head
for value in L[1:]:
current.next_node = Node(value)
current = current.next_node
def partlyreverse(self):
tail_start = self.head
tail_end = self.head
tail2_start = None
tail2_end = None
current_node = self.head.next_node
while current_node != None:
if current_node.value % 2 == 1:
next_current_node = current_node.next_node
current_node.next_node = tail_start
tail_start = current_node
current_node = next_current_node
else:
if not tail2_start:
tail2_start = current_node
tail2_end = tail2_start
current_node = current_node.next_node
else:
tail2_end.next_node = current_node
tail2_end = current_node
current_node = current_node.next_node
tail_end.next_node = tail2_start
self.head = tail_start
L = Linkedlist([7,5,3,1,2,4,6,8])
L.partlyreverse()
def RecursivelyPrintNodes(node):
if node != None:
print node.value
RecursivelyPrintNodes(node.next_node)
RecursivelyPrintNodes(L.head)
# 1,3,5,7,2,4,6,8
</code></pre>
<p>最后,我了解了您在代码中的意图,但需要注意的是,您编写的代码无法编译(类中存在缩进错误)。你知道吗</p>