简单的只有add he delete 功能
class linknode():
def __init__(self,val):
self.val = val
self.next = None
class gen_Linklist():
def __init__(self,linklist):
'''ll node0'''
self.ll = linklist
def add(self,val):
next_node = linknode(val)
p = self.ll
while p.next:
p = p.next
p.next = next_node
return self.ll
def delete(self,data):
'''pos 删除的值 ll 删除不重复的值'''
p = self.ll
q = self.ll.next
while p.next and q:
if q.val == data:
break
p = p.next
q = q.next
if p.next:
p.next = p.next.next
return self.ll
def print_ll(self):
p = self.ll.next
res = []
while p:
res.append(p.val)
p = p.next
print(res)
return res
example
init_l = linknode(0)
list_l = [1,3,5,7,9]
getll = gen_Linklist(init_l)
for i in list_l:
getll.add(i)
getll.print_ll()
getll.delete(4)
getll.print_ll()
getll.delete(1)
getll.print_ll()