# 单向链表的节点定义
class Node(object):
def __init__(self, item):
self.elem = item
self.next = None
class SingleLinkList(object):
"""单向链表的基本操作"""
def __init__(self, node=None):
self.__head = node
if node:
node.next = node
def is_empty(self):
# 判断链表是否是空
return self.__head == None
def length(self):
# 链表长度
# if self.is_empty(): # 空链表
# return 0
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
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
def insert(self, pos, item):
# 往链表的指定位置插入元素
if pos <= 0:
# 往头部插入
self.add(item)
elif pos > (self.length() - 1):
# 往尾部插入
self.append(item)
else:
# 在链表中间pos位置插入元素
pre = self.__head
count = 0
while count < pos:
pre = pre.next
count += 1
node = Node(iten)
tmp = pre.next
pre.next = node
node.next = tmp
def remove(self, item):
# 删除链表中的指定节点
cur = self.__head
pre = None
while cur != None:
if cur.elem == item:
# 判断待删除的节点是否是头结点
if cur == self.__head:
self.__head = cur.next
else:
pre.next = cur.next
break
else:
pre = cur # 待删除节点的前一个节点
cur = cur.next
def search(self, item):
# 查找指定节点是否存在
cur = self.__head
while cur != None:
if cur.elem == item:
return True
else:
cur = cur.next
return False
if __name__ == "__main__":
sll = SingleLinkList()
print("往链表头部中插入元素:", sll.add(1))
print("往链表尾部插入元素:", sll.append(2))
print("往链表指定位置插入元素:", sll.insert(0,3))
print("往链表尾部插入元素:", sll.append(5))
print("当前链表是否为空:", sll.is_empty())
print("当前链表的长度为:", sll.length())
print("搜索元素是否存在:", sll.search(3))
print("移除链表中的指定元素:", sll.remove(5))
print("遍历链表中的全部元素:", sll.travel())