双链表的节点类
class Node(object):
"""双链表的节点类"""
def __init__(self, item):
self.item = item
self.next = None
self.prev = None
双链表 - 查找/判空/长度/遍历 和单链表相同,也可直接继承
class DoubleLinkList(object):
"""双链表"""
def __init__(self, node=None):
self.__head = node
def add(self, item):
"""头插法"""
node = Node(item)
node.next = self.__head
self.__head = node
node.next.prev = node
def append(self, item):
"""尾插法"""
node = Node(item)
if self.is_empty():
self.__head = node
else:
cur = self.__head
while cur.next:
cur = cur.next
cur.next = node
node.prev = cur
def insert(self, pos, item):
"""
指定位置添加元素
:param pos: 起始从 0 开始
:param item: 数据
:return:
"""
if pos <= 0:
self.add(item)
elif pos > self.length() - 1:
self.append(item)
else:
node = Node(item)
cur = self.__head
count = 0
while count < pos:
cur = cur.next
count += 1
node.next = cur
node.prev = cur.prev
cur.prev.next = node
cur.prev = node
def remove(self, item):
"""删除节点"""
cur = self.__head
while cur:
if cur.item == item:
if cur == self.__head:
self.__head = cur.next
# 判断链表是否只有一个节点
if cur.next:
cur.next.prev = None
else:
cur.prev.next = cur.next
if cur.next:
cur.next.prev = cur.prev
return
else:
cur = cur.next
def search(self, item):
"""查找节点是否存在"""
cur = self.__head
while cur:
if cur.item == item:
return True
else:
cur = cur.next
return False
def is_empty(self):
"""判断链表是否为空"""
return self.__head is None
def length(self):
"""链表长度"""
# cur 指针,用来移动遍历节点
cur = self.__head
# count 记录节点数量
count = 0
while cur is not None:
count += 1
cur = cur.next
return count
def travel(self):
"""遍历整个链表"""
cur = self.__head
while cur:
print(cur.item, end=' ')
cur = cur.next
print('')
测试代码:
if __name__ == '__main__':
# --- testing: is_empty() / length() ---
dll = DoubleLinkList()
print(dll.is_empty())
print(dll.length())
dll.append(1)
print(dll.is_empty())
print(dll.length())
# --- testing: add() / append() / travel() ---
dll.add(8)
dll.append(2)
dll.append(3)
dll.append(4)
dll.append(5)
dll.append(6)
dll.travel() # 8 1 2 3 4 5 6
# --- testing: insert() ---
dll.insert(-1, 9) # 9 8 1 2 3 4 5 6
dll.travel()
dll.insert(3, 100) # 9 8 1 100 2 3 4 5 6
dll.travel()
dll.insert(10, 200) # 9 8 1 100 2 3 4 5 6 200
dll.travel()
# --- testing: remove() ---
dll.remove(100)
dll.travel() # 9 8 1 2 3 4 5 6 200
dll.remove(9)
dll.travel() # 8 1 2 3 4 5 6 200
dll.remove(200)
dll.travel() # 8 1 2 3 4 5 6