class Node(object): def __init__(self, value, prior=None, next=None): self.value = value self.next = next self.prior = prior class LinkList(object): def __init__(self, node=None): self.__head = node def add(self, value): """ 双向链表头添加元素 :param value: :return: """ L1 = self.__head node = Node(value) node.next = L1 self.__head = node def append(self, value): """ 双向链表尾添加元素 :param value: :return: """ L1 = self.__head if L1 and value: node = Node(value) while L1.next: L1 = L1.next L1.next = node node.prior = L1 else: node = Node(value) self.__head = node node.prior = self.__head
python 双向链表操作(insert,delete)
最新推荐文章于 2021-11-13 07:00:00 发布
本文介绍了Python中双向链表的实现,包括初始化、添加元素(头尾)、删除元素、获取链表长度、检查是否为空、遍历以及插入指定位置等操作。提供了详细的代码示例,如添加、删除节点等。
摘要由CSDN通过智能技术生成