循环单链表节点实现:
# coding:utf-8
class Node(object):
"""循环单链表节点"""
def __init__(self, elem):
self.elem = elem
self.next = None
# node = Node(100)
循环单链表的增删改查等操作的实现:
# coding:utf-8
class SingleCycleLinkList(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):
"""链表长度"""
# cur为游标,用来移动遍历节点
if self.is_empty():
return 0
cur = self._head
# count记录数量
count = 1
while cur.next != self._head:
count += 1
cur = cur.next
return count
def travel(self):
"""遍历打印整个链表"""
if self.is_empty():
return
cur = self._head
while cur.next != self._head:
print(cur.elem, end=" ")
cur = cur.next
print(cur.elem)
def add(self, item):
"""链表头部添加元素"""
global cur
node = Node(item)
if self.is_empty():
self._head = node
node.next = node
else:
cur = self._head
while cur.next != self._head:
cur = cur.next
# 退出循环,cur指向尾节点
node.next = self._head
self._head = node
cur.next = self._head
def append(self, item):
"""链表尾部添加元素"""
node = Node(item)
if self.is_empty():
self._head = node
node.next = node
else:
cur = self._head
while cur.next != self._head:
cur = cur.next
cur.next = node
node.next = self._head
def insert(self, pos, item):
"""指定位置添加某一元素
:param pos从0开始
"""
if pos <= 0:
self.add(item)
elif pos > (self.length()-1):
self.append(item)
else:
pre = self._head
count = 0
while count < (pos-1):
count += 1
pre = pre.next
node = Node(item)
node.next = pre.next
pre.next = node
def remove(self, item):
"""删除某一节点"""
if self.is_empty():
return
cur = self._head
pre = None
while cur.next != self._head:
if cur.elem == item:
# 先判断此节点是否为头节点
if cur == self._head:
# 删除头节点
rear = self._head
while rear.next != self._head:
rear = rear.next
self._head = cur.next
rear.next = self._head
else:
# 中间节点
pre.next = cur.next
return
else:
pre = cur
cur = cur.next
# 退出循环,cur指向尾节点
if cur.elem == item:
if cur == self._head:
# 表示链表只有一个节点
self._head = None
else:
pre.next = cur.next
def search(self, item):
"""查找某一节点是否存在"""
if self.is_empty():
return False
cur = self._head
while cur.next != self._head:
if cur.elem == item:
return True
else:
cur = cur.next
# 退出循环,cur指向尾节点
if cur.elem == item:
return True
return False