数据结构与算法(python)----------队列相关的操作

队列的基本操作

from pythonds.basic.queue import Queue
# 创建一个空队列
queue = Queue()
# 判断此队列是否为空
print(queue.isEmpty())
# 给队列中插入数值
queue.enqueue('我是谁')
queue.enqueue('2021年')
queue.enqueue('新年快乐')
# 返回队列的长度
print(queue.size())
# 此时一定要明白在队列中前后是怎么定义的
# 例如：上面queue队列，我先插入‘我是谁’，在插入‘2021年’，在插入‘新年快乐’
#      那么在队列中展示的应该是queue = ['新年快乐','2021年','我是谁']
#      在队列中把'我是谁'这个位置定义为前
#             把‘新年快乐’这个位置定义为后


# 踢出最前面位置的内容
#print(queue.dequeue())  # 我是谁
# 踢出的内容可以赋值给对象
str = queue.dequeue()
print(str)
print(queue.size())     # 此时queue的队列长度就是2
print(queue.dequeue())  # 2021年
print(queue.size())

热土豆问题

from pythonds.basic.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):
            simqueue.enqueue(simqueue.dequeue())
        # simqueue.dequeue()
        print("1"+simqueue.dequeue())
    return simqueue.dequeue()


print(hotPotato(["aa", "bb", "cc", "dd", "ee", "ff", "gg", "hh"], 7))
print(hotPotato(["aa", "bb", "cc", "dd", "ee", "ff", "gg", "hh"], 7))
print(hotPotato(["aa", "bb", "cc", "dd", "ee", "ff", "gg", "hh"], 7))

打印机实例

from pythonds.basic.queue import Queue
import random


class Printer:
    def __init__(self, ppm):
        # 打印速度
        self.pagerate = ppm
        # 打印任务
        self.cureentTask = None
        # 任务倒计时
        self.timeRemaining = 0

    def tick(self):  # 打印1秒
        if self.cureentTask != None:
            self.timeRemaining = self.timeRemaining - 1
            if self.timeRemaining <= 0:
                self.cureentTask = None

    def busy(self):  # 打印忙
        if self.cureentTask != None:
            return True
        else:
            return False

    def startNext(self, newtask):
        self.cureentTask = newtask
        self.timeRemaining = newtask.getPages() * 60 / self.pagerate


class Task:
    def __init__(self, time):
        # 生成时间戳
        self.timestamp = time
        # 打印页数
        self.pages = random.randrange(1, 21)

    def getStamp(self):
        return self.timestamp

    def getPages(self):
        return self.pages

    def waitTime(self, currenttime):
        # 等待时间
        return currenttime - self.timestamp


def newPrintTask():
    # 1/180概率生成作业
    num = random.randrange(1, 181)
    if num == 180:
        return True
    else:
        return False


def simulation(numSeconds, pagesPerMinute):
    labprinter = Printer(pagesPerMinute)
    printQueue = Queue()
    waitingtimes = []
    for currentSecond in range(numSeconds):
        if newPrintTask():
            task = Task(currentSecond)
            printQueue.enqueue(task)
        if (not labprinter.busy()) and (not printQueue.isEmpty()):
            nexttask = printQueue.dequeue()
            waitingtimes.append(nexttask.waitTime(currentSecond))
            labprinter.startNext(nexttask)
        labprinter.tick()
    averageWait = sum(waitingtimes) / len(waitingtimes)
    print("Average Wait %6.2f secs %3d tasks remaining" % (averageWait, printQueue.size()))


for i in range(20):
    simulation(3600, 10)

双端队列基本操作

from pythonds.basic.deque import Deque

# 创建一个空的双端队列
d = Deque()
# 判断是否为空
print(d.isEmpty())
# 在后端加入数据  队列中如同----["新年快乐","2021年","我是谁"]
d.addRear("我是谁")
d.addRear("2021年")
d.addRear("新年快乐")
# 在前端加入数据  队列中如同----["推荐算法","大数据开发","NLP算法开发"]
d.addFront("推荐算法")
d.addFront("大数据开发")
d.addFront("NLP算法开发")
# 查看队列的长度
print(d.size())
# 从后端踢出数据
print(d.removeRear())
# 从前端踢出数据
#print(d.removeFront())

双端队列的基本应用—回文词

from pythonds.basic.deque import Deque

def palchecker(aString):
    chardeque = 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("123456789987654321"))