Python数据结构队列解决约瑟夫斯问题_python

class Queue:
    def __init__(self):
        self.items = []
    def is_empty(self):
        return self.items == []
    # 
    def enqueue(self, item):
        self.items.insert(0, item)
    # 
    def dequeue(self):
        return self.items.pop()
    def size(self):
        return len(self.items)

import my_queue
def hotPotato(namelist, num):
    queue = my_queue.Queue()
    for name in namelist:
        queue.enqueue(name)
    while queue.size() > 1:
        for i in range(num):
            queue.enqueue(queue.dequeue())
        queue.dequeue()
    return queue.dequeue()
print(hotPotato([1, 2, 3, 4, 5, 6], 7))

class Deque:
    def __init__(self):
        self.items = []
    def isEmpty(self):
        return self.items == []
    def addFront(self, item):
        self.items.append(item)
    def addRear(self, item):
        self.items.insert(0, item)
    def removeFront(self):
        return self.items.pop()
    def removeRear(self):
        return self.items.pop(0)
    def size(self):
        return len(self.items)

import my_deque
def palchecker(aString):
    chardeque = my_deque.Deque()
    for ch in aString:
        chardeque.addRear(ch)
    stillEqual = True
    while chardeque.size() > 1 and stillEqual:
        first = chardeque.removeFront()
        last = chardeque.removeRear()
        if first != last:
            stillEqual = False
    return stillEqual
print(palchecker('aaaabaaaa'))
print(palchecker('aaaabaaab'))