Python使用队列解决约瑟夫环问题

from pythonds.basic.queue import Queue

def hotPota(nameList, num):
    simqueue = Queue()
    for name in nameList:
        simqueue.enqueue(name)
    print("Queue init:", simqueue.items)
    while simqueue.size() > 1:
        for i in range(num):
            simqueue.enqueue(simqueue.dequeue())
            print(simqueue.items)
        simqueue.dequeue()
        #print(simqueue.items)

    return simqueue.dequeue()
print(hotPota(["Harden", "Kobe", "Durant", "James", "Wade", "Curry"], 7))

Queue init: ['Curry', 'Wade', 'James', 'Durant', 'Kobe', 'Harden']
['Harden', 'Curry', 'Wade', 'James', 'Durant', 'Kobe']
['Kobe', 'Harden', 'Curry', 'Wade', 'James', 'Durant']
['Durant', 'Kobe', 'Harden', 'Curry', 'Wade', 'James']
['James', 'Durant', 'Kobe', 'Harden', 'Curry', 'Wade']
['Wade', 'James', 'Durant', 'Kobe', 'Harden', 'Curry']
['Curry', 'Wade', 'James', 'Durant', 'Kobe', 'Harden']
['Harden', 'Curry', 'Wade', 'James', 'Durant', 'Kobe']
['Durant', 'Harden', 'Curry', 'Wade', 'James']
['James', 'Durant', 'Harden', 'Curry', 'Wade']
['Wade', 'James', 'Durant', 'Harden', 'Curry']
['Curry', 'Wade', 'James', 'Durant', 'Harden']
['Harden', 'Curry', 'Wade', 'James', 'Durant']
['Durant', 'Harden', 'Curry', 'Wade', 'James']
['James', 'Durant', 'Harden', 'Curry', 'Wade']
['Curry', 'James', 'Durant', 'Harden']
['Harden', 'Curry', 'James', 'Durant']
['Durant', 'Harden', 'Curry', 'James']
['James', 'Durant', 'Harden', 'Curry']
['Curry', 'James', 'Durant', 'Harden']
['Harden', 'Curry', 'James', 'Durant']
['Durant', 'Harden', 'Curry', 'James']
['Curry', 'Durant', 'Harden']
['Harden', 'Curry', 'Durant']
['Durant', 'Harden', 'Curry']
['Curry', 'Durant', 'Harden']
['Harden', 'Curry', 'Durant']
['Durant', 'Harden', 'Curry']
['Curry', 'Durant', 'Harden']
['Durant', 'Curry']
['Curry', 'Durant']
['Durant', 'Curry']
['Curry', 'Durant']
['Durant', 'Curry']
['Curry', 'Durant']
['Durant', 'Curry']
Durant

定义一个队列类

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

True
None
[0]