约瑟夫问题python列表_python环形单链表的约瑟夫问题详解

class Node(object):

def __init__(self, value, next=0):

self.value = value

self.next = next # 指针

class RingLinkedList(object):

# 链表的数据结构

def __init__(self):

self.head = 0 # 头部

def __getitem__(self, key):

if self.is_empty():

print 'Linked list is empty.'

return

elif key < 0 or key > self.get_length():

print 'The given key is wrong.'

return

else:

return self.get_elem(key)

def __setitem__(self, key, value):

if self.is_empty():

print 'Linked list is empty.'

return

elif key < 0 or key > self.get_length():

print 'The given key is wrong.'

return

else:

return self.set_elem(key, value)

def init_list(self, data): # 按列表给出 data

self.head = Node(data[0])