每个节点有两个链接:一个指向前一个节点,档次节点为第一个节点时,指向空值;而当另一个指向下一个节点,当此节点为最后一个节点时,指向空值。
双向链表结构
操作
- is_empty() 链表是否为空
- length() 链表长度
- travel() 遍历链表
- add(item) 链表头部添加
- append(item) 链表尾部添加
- insert(pos, item) 指定位置添加
- remove(item) 删除节点
- search(item) 查找节点是否存在
执行位置插入元素执行图
删除元素执行图
实现
class Node(object):
"""双向链表节点"""
def __init__(self, item):
self.item = item
self.next = None
self.prev = None
class DLinkList(object):
"""双向链表"""
def __init__(self):
self._head = None
def is_empty(self): # 判空
return self._head == None
def length(self): # 返回链表长度
cur = self._head
count = 0
while cur != None:
count += 1
cur = cur.next
return count
def travel(self): # 遍历链表
cur = self._head
while cur != None:
print(cur.item)
cur = cur.next
def add(self, item): # 头部插入元素
node = Node(item)
if self.is_empty():
self._head = node
else:
node.next = self._head
self._head.prev = node
self._head = node
def append(self, item): # 尾部插入元素
node = Node(item)
if self.is_empty():
self._head = node
else:
cur = self._head
while cur.next != None:
cur = cur.next
cur.next = node
node.prev = cur
def search(self, item): # 查找元素
cur = self._head
while cur != None:
if cur.item == item:
return True
cur = cur.next
return False
def insert(self, pos, item): # 在指定位置插入元素
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 - 1):
count += 1
cur = cur.next
node.prev = cur
node.next = cur.next
cur.next.prev = node
cur.next = node
def remove(self, item): # 删除 元素
if self.is_empty():
return
else:
cur = self._head
if cur.item == item:
if cur.next == None:
self._head = None
else:
cur.next.prev = None
self._head = cur.next
return
while cur != None:
if cur.item == item:
# 将item所在节点的前一个节点的next 指向 item所在节点后一个节点
cur.prev.next = cur.next
# 将item所在节点的后一个节点的prev指向item的前一个节点
cur.next.prev = cur.prev
break
cur = cur.next
if __name__ == "__main__":
l1 = DLinkList()
l1.add(1)
l1.add(2)
l1.append(3)
l1.insert(2, 4)
l1.insert(4, 5)
l1.insert(0, 6)
print("length:", l1.length())
print("------------------")
l1.travel()
print(l1.search(3))
print(l1.search(4))
l1.remove(1)
print("length:", l1.length())
l1.travel()