python 鏈表去重

class LinNode:
    def __init__(self, val):
        self.val = val
        self.next = None

def confict(l):
    li = []
    h1 = l
    li.append(h1.val)
    h2 = l.next
    while h2:
        if h2.val in li:
            h1.next = h2.next
        else:
            li.append(h2.val)
        h1 = h2
        h2 = h2.next
    return l