singly_linked_list
singly_linked_list.py 源码
# 单链表实现
# 节点定义
class ListNode:
def __init__(self, val):
self.next = None
self.val = val
class LinkedList:
def __init__(self):
self.head = None
# 根据值查找节点
def find(self, val):
p = self.head
while p and p.val != val:
p = p.next
return p
# 添加节点至链表末尾
def add(self, val) -> ListNode:
node = ListNode(val)
if not self.head:
self.head = node
else:
p = self.head
while p.next:
p = p.next
p.next = node
return node
# 在某个节点之前添加
def addBefore(self, p: ListNode, val):
if not p:
return
node = ListNode(val)
# 在头节点之前插入
if p is self.head:
node.next = self.head
self.head = node
else:
prev = self.head
while prev and prev.next != p:
prev = prev.next
if prev:
node.next = p
prev.next = node
# 在某个节点之后插入
def addAfter(self, p: ListNode, val):
if not p:
return
node = ListNode(val)
node.next = p.next
p.next = node
# 删除节点
def delete(self, node: ListNode) -> bool:
p = self.head
while p and p.next != node:
p = p.next
if not p:
return False
p.next = p.next.next
return True
# 打印所有元素值
def print(self):
if not self.head:
return
p = self.head
while p:
print(p.val, end=' ')
p = p.next
print()
if __name__ == '__main__':
lis = LinkedList()
lis.add(1)
n1 = lis.add(3)
n2 = lis.add(5)
lis.print()
lis.delete(n2)
lis.print()
lis.addBefore(n1, 10)
lis.print()
你可能感兴趣的文章
0
赞
热门推荐
-
2、 - 优质文章
-
3、 gate.io
-
6、 golang
-
7、 openharmony