在Python中合并链表

我正在尝试合并两个已排序的链接列表。我可以通过每次添加元素时创建一个节点来实现这一点。但是，我不希望创建新节点，而是希望使用旧节点

这就是实现

from LinkedListImplementation import LinkedList


MLL = LinkedList()

LL1 = LinkedList()
LL2 = LinkedList()

array_list1 = [2, 4, 5, 7, 11, 12, 15, 20]
array_list2 = [3, 6, 9, 10]

for p in array_list1:
    LL1.addElement(p)

for q in array_list2:
    LL2.addElement(q)


while(LL1.size and LL2.size):
    e1 = LL1.Head.element
    e2 = LL2.Head.element
    if e1 < e2:
        MLL.addElement(LL1.removeElement())
    else:
        MLL.addElement(LL2.removeElement())

    if LL1.size:
        MLL.Tail.Next=LL1.Head
    else:
        MLL.Tail.Next=LL2.Head

MLL.displayLinkedList()

如果名称=“\uuuuu main\uuuuuuuu”：
MLL=LinkedList（）
LL1=链接列表（）
LL2=链接列表（）
数组_list1=[2,4,5,7,11,12,15,20]
数组_list2=[3,6,9,10]
对于数组_列表1中的p：
LL1.附录（p）
对于数组_列表2中的q：
LL2.加法（q）
cur_node_l1=LL1.头部
cur_node_l2=LL2.Head
cur_node=MLL.Head；
while（cur_node_l1和cur_node_l2）：
e1=电流节点l1.元素
e2=当前节点l2.元素
如果e1

那么，代码的确切问题是什么？代码没有问题，我想在空间复杂度O（1）中合并两个链表。

class LinkedList:

    class _Node:

        __slots__ = 'element', 'Next'

        def __init__(self, element, Next):
            self.element = element
            self.Next = Next


    def __init__(self):
        '''
        Constructor
        '''
        self.size = 0
        self.Head = None
        self.Tail = None

    def addElement(self, e):
        newestNode = self._Node(e, None)
        if self.size==0:
            self.Head = newestNode
            self.Tail = newestNode
        else:
            newestNode.Next=None
            self.Tail.Next=newestNode
            self.Tail=newestNode
        self.size += 1

    def removeElement(self):
        if self.size == 0:
            print "The Linked List is Empty"
        else:
            value = self.Head.element
            self.Head = self.Head.Next
            self.size -= 1
        if self.size == 0:
            self.Head = None
        return value


    def displayLinkedList(self):

        tempNode = self.Head
        while(tempNode.Next is not None):
            print "Current node element is [%d]" % tempNode.element
            print "Next node element is [%d]" % tempNode.Next.element
            tempNode = tempNode.Next
        else:
            if self.size == 1:
                print "Linked List has only element [%d]" %tempNode.element

    def isEmpty(self):
        return self.size == 0 

if __name__ == "__main__":
    MLL = LinkedList()

    LL1 = LinkedList()
    LL2 = LinkedList()

    array_list1 = [2, 4, 5, 7, 11, 12, 15, 20]
    array_list2 = [3, 6, 9, 10]

    for p in array_list1:
        LL1.addElement(p)

    for q in array_list2:
        LL2.addElement(q)

    cur_node_l1 = LL1.Head
    cur_node_l2 = LL2.Head
    cur_node = MLL.Head; 
    while(cur_node_l1 and cur_node_l2):
        e1 = cur_node_l1.element
        e2 = cur_node_l2.element
        if e1 < e2:
            if not cur_node:
                cur_node =  cur_node_l1;
                MLL.Head = cur_node
            else:
                cur_node.Next = cur_node_l1;
                cur_node = cur_node_l1
            cur_node_l1 = cur_node_l1.Next
#            MLL.TAIL = cur_node_l1;

        else:
            if not cur_node:
                cur_node =  cur_node_l2;
                MLL.Head = cur_node
            else:
                cur_node.Next = cur_node_l2;
                cur_node = cur_node_l2;
            cur_node_l2 = cur_node_l2.Next
#        MLL.TAIL = cur_node_l2;
    if (cur_node_l1):
        cur_node.Next = cur_node_l1
        cur_node = LL1.Tail;
    if (cur_node_l2):
        cur_node.Next = cur_node_l2
        cur_node = LL2.Tail;
    MLL.Tail = cur_node
    MLL.size = LL1.size + LL2.size
    MLL.displayLinkedList()