目录
1. 单向链表定义
单向链表也叫单链表,是链表中最简单的一种形式,它的每个节点包含两个域,一个信息域(元素域)和一个指针域。这个指针指向链表中的下一个节点,而最后一个节点的链接域则指向一个空值。
2. 单向链表的示意图
3. 代码分析与实现
链表由节点构成,因此首先需要定义节点。
3.1 节点实现
class Node:
def __init__(self, elem=None):
self.elem = elem # 数据域
self.next = None # 连接(类似指针)
3.2 链表实现
class SingleLinkList:
def __init__(self, node=None): # 创建对象的时候可以不传参数
self.__head = node
3.3 链表方法扩展
class SingleLinkList:
def __init__(self, node=None):
self.__head = node # 将表头设置为私有
def is_empty(self): # 链表判空
if self.__head is None:
return True
else:
return False
def length(self): # 链表长度
cur = self.__head
count = 0 # 记录长度
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.elem, end=" ")
cur = cur.next
print(" ")
def add(self, item): # 链表头部添加元素
node = Node(item)
node.next = self.__head
self.__head = node
def append(self, item): # 链表尾部添加元素
node = Node(item)
if self.is_empty():
self.__head = node
else:
cur = self.__head
while cur.next is not None:
cur = cur.next
cur.next = node
def insert(self, pos, item): # 指定位置添加元素
# pos 的位置从0起
if pos <= 0: # 头部插入
self.add(item)
elif pos > (self.length() - 1): # 尾部插入
self.append(item)
else: # 中间插入
index = 0
pre = self.__head
while index < (pos - 1):
index += 1
pre = pre.next
# 循环结束,pre在pos-1
node = Node(item)
node.next = pre.next
pre.next = node
def remove(self, item): # 删除节点
cur = self.__head
pre = None
while cur:
if cur.elem == item:
if cur == self.__head:
self.__head = cur.next
else:
pre.next = cur.next
return True
else:
pre = cur
cur = cur.next
return False
def search(self, item): # 查找节点
if self.is_empty():
return False
else:
cur = self.__head
while cur is not None:
if cur.elem == item:
return True
else:
cur = cur.next
return False