class Node(object):
def __init__(self, item):
self.item = item
# 下一个节点
self.next = None
# 上一个节点
self.pre = None
class DoubleLinkList(object):
def __init__(self):
self.__head = None
def is_empty(self):
"""链表是否为空"""
return self.__head is None
def length(self):
"""链表长度"""
count = 0
cur = self.__head
while cur is not None:
count += 1
cur = cur.next
return count
def travel(self):
"""遍历链表"""
cur = self.__head
while cur is not None:
print(cur.item,end=' ')
cur = cur.next
def add(self, item):
"""链表头部添加"""
node = Node(item)
if self.is_empty():
self.__head = node
return
node.next = self.__head
self.__head.pre = node
self.__head = node
def append(self, item):
"""链表尾部添加"""
if self.is_empty():
self.add(item)
else:
node = Node(item)
cur = self.__head
while cur.next is not None:
cur = cur.next
node.pre = cur
cur.next = node
def insert(self, pos, item):
"""指定位置添加"""
if pos <= 0:
self.add(item)
elif pos > (self.length() - 1):
self.append(item)
else:
node = Node(item)
index = 0
cur = self.__head
while index < (pos - 1):
cur = cur.next
index += 1
# 当前位置就是插入的前节点
node.next = cur.next
node.pre = cur
cur.next.pre = node
cur.next = node
def remove(self, item):
"""删除节点"""
cur = self.__head
while cur is not None:
if cur.item == item:
# 删除的是尾节点
if cur.next is None:
cur.pre.next = None
# 删除的是首节点
elif cur.pre is None:
self.__head = cur.next
else:
cur.pre.next = cur.next
cur.next.pre = cur.pre
return
cur = cur.next
def search(self, item):
"""查找节点是否存在"""
cur = self.__head
while cur is not None:
if cur.item == item:
return True
cur = cur.next
return False