单向循环链表
单链表的一个变形是单向循环链表,链表中最后一个节点的next域不再为None,而是指向链表的头节点。
实现以下操作:
代码:
class Node(object):
"""节点"""
def __init__(self, item):
self.item = item
self.next = None
class SinCycLinkedlist(object):
"""单向循环链表"""
def __init__(self):
self.__head = None
def is_empty(self):
"""判断链表是否为空"""
return self.__head == None
def length(self):
"""返回链表的长度"""
# 如果链表为空,返回长度0
if self.is_empty():
return 0
count = 1
cur = self.__head
while cur.next != self.__head:
count += 1
cur = cur.next
return count
def travel(self):
"""遍历链表"""
if self.is_empty():
print(' ')
return
cur = self.__head
while cur.next != self.__head:
print(cur.item,end=" ")
cur = cur.next
#从循环推出后cur指向尾节点,而此时循环已跳出,需另外打印出尾节点
print(cur.item)
def add(self, item):
"""头部添加节点"""
node = Node(item)
if self.is_empty():
self.__head = node
node.next = node
#寻找尾节点
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 = self.__head #node也可以
else:
# 移到链表尾部
cur = self.__head
while cur.next != self.__head:
cur = cur.next
# 退出循环的时候,cur指向尾节点
cur.next = node
# 将node指向头节点_head
node.next = self.__head
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):
count += 1
cur = cur.next
node.next = cur.next
cur.next = node
def remove(self, item):
"""删除一个节点"""
# 若链表为空,则直接返回
if self.is_empty():
return
# 将cur指向头节点
cur = self.__head
pre = None
while cur.next != self.__head:
if cur.item == 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.item == item:
if cur == self.__head:
# 链表只有一个节点
self.__head = None
else:
pre.next = self.__head
def search(self, item):
"""查找节点是否存在"""
if self.is_empty():
return False
cur = self.__head
while cur.next != self.__head:
if cur.item == item:
return True
cur=cur.next
#退出循环后,cur指向尾节点
if cur.item == item:
return Ture
return False
if __name__ == "__main__":
ll = SinCycLinkedlist()
ll.add(1)
ll.add(2)
ll.append(3)
ll.insert(2, 4)
ll.insert(4, 5)
ll.insert(0, 6)
print "length:",ll.length()
ll.travel()
print ll.search(3)
print ll.search(7)
ll.remove(1)
print "length:",ll.length()
ll.travel()
首先新建节点node类还是相对单向链表是不变的。然后判断链表是否为空也是不变的。
求取链表的长度,实现过程如下;
遍历整个链表,实现过程如下:
在头部添加节点,实现过程如下:
在尾部添加节点,实现过程如下:
在指定位置插入节点和单向链表一致。
删除节点,实现过程如下:
查找节点: