- 定义一个单循环链表
class SingleCycleLinkList(object):
def __init__(self,node):
self._head=node
if node!=None:
node.next=self._head
- 单循环链表相关函数
2.1 求长度 length( )
def length(self):
cur=self._head
count=0
if cur==None:
return count
else:
count=1
while(cur.next!=self._head):
count=count+1
cur=cur.next
return count
2.2 遍历打印 travel( )
def travel(self):
cur = self._head
if cur==None:
return
else:
while