数据结构与算法(python版)(四)
1、双向链表
每个节点有两个链接:一个指向前一个节点,当前节点为第一个节点时,指向空值;而另一个指向下一个节点,当前节点为最后一个节点时,指向空值。
2、双向链表的操作
① is_empty() 链表是否为空
② length() 链表长度
③ travel() 遍历链表
④ add(item) 头部添加元素
⑤ append(item) 尾部添加元素
⑥ insert(pos, item) 指定位置添加元素
⑦ remove(item) 删除节点
⑧ search(item) 查找节点是否存在
3、单链表代码实现
class Node(object):
#定义节点
def __init__(self, item):
self.elem = item
self.next = None
self.prev = None
class DoubleLinkList(object):
#双链表
def __init__(self, node = None):
#构造函数 ?
self.__head = node
#head属性指向头节点
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
#count达到总长度后,cur= cur.next = None跳出
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为首节点
self.__head = node #此处self.__head为node
node.next.pre = 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 insert(self, pos, item):
if pos <= 0:
self.add(item)
elif pos > (self.length()-1):
self.append(item)
else:
#插入到中间位置,先设置指针
cur = self.__head
count = 0
while count < pos:
count += 1
cur = cur.next
node = Node(item)
node.next = cur
node.prev = cur.prev
cur.prev.next = node
cur.prev = node
def search(self, item):
#查找节点
cur = self.__head
while cur != None:
if cur.elem == item:
return True
else:
cur = cur.next
return False
def remove(self, item):
#删除节点
cur = self.__head
while cur != None:
if cur.elem == item:
#判断此节点是否为头节点
if cur == self.__head:
self.__head = cur.next
if cur.next:
cur.next.prev = None #头节点去除后,第二个节点的prev指向None
else:
cur.prev.next = cur.next
if cur.next:
cur.next.prev = cur.prev
break
else:
cur = cur.next
if __name__ == '__main__':
ll = DoubleLinkList()
print(ll.is_empty())
print(ll.length())
ll.append(2)
ll.add(8)
ll.append(3)
ll.travel()
print(ll.length())
ll.append(3)
ll.append(6)
ll.append(9)
ll.append(3)
ll.travel()
ll.remove(6)
ll.remove(8)
ll.travel()
print(ll.search(8))
ll.insert(1,123)
ll.travel()