原题目:在单链表L中删除一个最小值节点,算法尽可能高效,且假设最小值节点为唯一。
原答案实在是蠢,特别复杂,看不懂,不想看。
自己写了个递归,时间复杂度o(n),空间复杂度o(1),优雅的解决了这个问题。
class LNode:
def __init__(self, x):
self.val = x
self.next = None
def func(head, minnum):
minnum = min(head.val, minnum)
if head.next:
head.next, minnum = func(head.next, minnum)
if head.val == minnum:
head = head.next
return head, minnum
if __name__ == '__main__':
l1 = LNode(3)
l1.next = LNode(1)
l1.next.next = LNode(2)
l = func(l1, 3)
print l[0].val,l[0].next.val
有没有很cool~~~~~~~~~~~:)