class Node(object):
def __init__(self, element):
self.element = element
self.next = None
self.prov = None
class DoubleLinkList(object):
"""链表"""
def __init__(self, node=None):
self.__head = node
def is_empty(self):
"""判断是否为空"""
return self.__head is 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.elem, end=" ")
cur = cur.next
print('')
def add(self, item):
"""在链表头部添加元素"""
node = Node(item)
node.next = self.__head
self.__head = node
node.next.prov = 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.prov = cur
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:
cur = cur.next
count += 1
node.next = cur.next
cur.next.prov = node
cur.next = node
node.prov = cur
def remove(self, item):
"""删除节点"""
cur = self.__head
while cur != None:
if cur.elemt == item:
if cur == self.__head:
self.__head == cur.next
cur.next.prov = None
if cur.prov:
cur.next.prov = None
else:
cur.prov.next = cur.next
if cur.next:
cur.next.prov = cur.prov
break
else:
cur = cur.next
def search(self, item):
"""查找节点是否存在"""
cur = self.__head
while cur != None:
if cur.elemt == item:
return True
else:
cur = cur.next
return False