单链表是一个变形的单向循环链表,链表中最后的一个节点的next域不再为None,而是指向链表的头结点
单向循环链表的增、删、查实现
class Node(object):
def __init__(self, item):
self.item = item
self.next = None
class SinCyLinkList(object):
def __init__(self):
self.head = None
def is_empty(self):
return self.head == None
def length(self):
'''链表长度'''
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():
return
cur = self.head
while cur.next !=