删除单链表中最大结点

Question

 

Answer 1

class Node:
    def __init__(self, value, next=None):
        self.value = value
        self.next = next


class SinglyLinkedList:

    def __init__(self, data: list):
        length = len(data)
        p = Node(0, None)
        self.head = p
        for i in range(length):
            p.value = data[i]
            if i < length - 1:
                p = Node(0, Node)
                p.next = p

    def delete_max(self):
        max_item = 0

        p = self.head
        while p:
            if p.value > max_item:
                max_item = p.value

        p = self.head
        q = p
        while p:
            if p.value == max_item:
                q.next = p.next
                break

            q = p
            p = p.next


if __name__ == 'main':
    linkedList = SinglyLinkedList([1, 3, 2, 9, 0, 4, 7, 6, 5, 8])
    linkedList.delete_max()

大概是这样，没时间调试，你可以自己调试一下