Python数据结构知识之队列(三)

队列的简单实现

Queue.py
# Author: Allen Guo
# Data: 2018-01-22
# For github repos please check <https://github.com/wilixx/python_training> .
# For more about the author, see to <www.whoispm.com> but note the disclaimer there.

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)

Hot Potato游戏(源程序有误,已经修改)

HotPotato.py
# Author: Allen Guo
# Data: 2018-01-22
# For github repos please check <https://github.com/wilixx/python_training> .
# For more about the author, see to <www.whoispm.com> but note the disclaimer there.

from Queue import Queue
def hotPotato(namelist, num):
    simqueue = Queue()
    for name in namelist:
        simqueue.enqueue(name)
    while simqueue.size() > 1:
        for i in range(num-1):#Note that the Number must minus 1,here modified my me.
            simqueue.enqueue(simqueue.dequeue())
        simqueue.dequeue()
    return simqueue.dequeue()
最后编辑于
©著作权归作者所有,转载或内容合作请联系作者
【社区内容提示】社区部分内容疑似由AI辅助生成,浏览时请结合常识与多方信息审慎甄别。
平台声明:文章内容(如有图片或视频亦包括在内)由作者上传并发布,文章内容仅代表作者本人观点,简书系信息发布平台,仅提供信息存储服务。

相关阅读更多精彩内容

友情链接更多精彩内容