【数据结构】【队列】一.热土豆

class Queue:
    def __init__(self):
        self.items = []
    def isEmpty(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)

def hotPotato(namelist, num):
    simqueue = Queue()
    for name in namelist:  # 把人名都加入队列中
        simqueue.enqueue(name)
    
    while simqueue.size() > 1:
        for _ in range(num):
            simqueue.enqueue(simqueue.dequeue())  # 一次传递
        simqueue.dequeue()  # 传递Num次后把队尾拿到土豆的人出队，不再回来

    return simqueue.dequeue()


print(hotPotato(['bill','david','susan','jane','kent','brad'],7))