数据结构与算法Python版p21-p24 队列

B站视频-数据结构与算法Python版

一、创建队列

# 右端是队首
class Queue:
    def __init__(self):
        self.items = []
    def enqueue(self,item):
        self.items.insert(0,item)
    def dequeue(self):
        return self.items.pop()
    def isEmpty(self):
        if len(self.items) == 0:
            return True
        else:
            return False
    def size(self):
        return len(self.items)

二、热土豆问题

def hotPotato(namelist,num):
    queue = Queue()
    # 依次进队列
    for i in namelist:
        queue.enqueue(i)
    while queue.size() > 1:
        for i in range(num):
        # 依次出队列到队尾，num次后去除队首元素
            person = queue.dequeue()
            queue.enqueue(person)
        print(queue.dequeue())
    return queue.items

三、打印问题

唉，不会写，感觉自己不会写类，基本copy的。。。

import random
class Printer:
    def __init__(self,ppm):
        self.pagerate = ppm
        self.currentTask = None
        self.timeRemain = 0
    def tick(self):
        if self.currentTask != None:
            self.timeRemain = self.timeRemain - 1
            if self.timeRemain <= 0:
                self.currentTask = None
    def busy(self):
        if self.currentTask == None:
            return False
        else:
            return True
    def startNext(self,newTask):
        self.timeRemain = newTask.getPages() * 60 / self.pagerate
        self.currentTask = newTask
class Task:
    def __init__(self,time):
        self.pages = random.randrange(1,21)
        self.timestamp = time# 记录任务产生的时间，便于后面计算等待时间
    def getPages(self):
        return self.pages
    def getStamp(self):
        return self.timestamp
    def waitTime(self,currenttime):
        return currenttime - self.timestamp
def newPrintTask():
    # 判断是否产生一个任务，返回T则产生
    num = random.randrange(1,181)
    if num == 180:
        return True
    else:
        return False
def simulation(numSeconds,pagesPerMinute):
    # numSeconds仿真总时间，pagesPerMinute打印机每分钟打印页数
    labprinter = Printer(pagesPerMinute)
    printqueue = Queue()
    waitingtimes = []
    for currentSecond in range(numSeconds):
        if newPrintTask():
            task = Task(currentSecond)
            printqueue.enqueue(task)
        if labprinter.currentTask == None and printqueue.size() != 0:
            # 如果打印机闲置且任务队列不为空，把任务队列的队首pop出来，执行
            nexttask = printqueue.dequeue()
            # 当前任务有一个timestamp属性，记录的是任务被创建出来的时间task = Task(numSeconds)
            # 所以被创建时间-现在的时间currentSecond，就是任务的等待时间，每个任务都会轮到，等待时间都会被计算
            waitingtimes.append(nexttask.waitTime(currentSecond))
            # 记录新任务需要的时间，更新打印机状态
            labprinter.startNext(nexttask)
        # 任务需要时间减一，更新打印机状态，每一秒都要更新打印机状态，这样才需要上面的if判断是否出队列  
        labprinter.tick()
    averageWait = sum(waitingtimes) / len(waitingtimes)
    print(f'Average Wait {averageWait}  {printqueue.size()} tasks remaining')