编写程序，实现在带头结点的单链表L中删除一个最小值节点的算法。

算法复杂度0(n)

#!/usr/bin/env python3

class LNode(object):
        def __init__(self, elem, next_=None):
                self.elem = elem
                self.next = next_

class Rm_Small_List(object):
        def __init__(self):
                self.head = None
                self.num = 0

        def prepend(self, elem):
                self.head = LNode(elem, self.head)
                self.num += 1

        def rm_small(self):
                p = self.head
                small = p.elem
                while p.next:
                        p = p.next
                        if small > p.elem:
                                small = p.elem
                p = self.head
                pre = None
                while p:
                        if not pre and p.elem == small:
                                self.head = self.head.next
                                return
                        if p.elem == small:
                                pre.next = p.next
                                return
                        pre = p
                        p = p.next

        def bianli(self):
                p = self.head
                li = []
                while p:
                        li.append(p.elem)
                        p = p.next
                return li

if __name__ == '__main__':
        l = Rm_Small_List()
        l.prepend(8)
        l.prepend(2)
        l.prepend(3)
        l.prepend(5)
        print(l.bianli())
        l.rm_small()
        print(l.bianli())

结果：

[5, 3, 2, 8]
[5, 3, 8]